NO Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-21 23:44:11,580 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-21 23:44:11,582 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-21 23:44:11,594 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-21 23:44:11,594 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-21 23:44:11,595 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-21 23:44:11,596 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-21 23:44:11,597 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-21 23:44:11,599 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-21 23:44:11,600 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-21 23:44:11,601 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-21 23:44:11,601 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-21 23:44:11,602 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-21 23:44:11,603 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-21 23:44:11,604 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-21 23:44:11,604 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-21 23:44:11,605 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-21 23:44:11,607 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-21 23:44:11,609 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-21 23:44:11,610 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-21 23:44:11,611 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-21 23:44:11,612 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-21 23:44:11,614 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-21 23:44:11,614 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-21 23:44:11,615 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-21 23:44:11,615 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-21 23:44:11,616 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-21 23:44:11,617 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-21 23:44:11,617 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-21 23:44:11,618 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-21 23:44:11,618 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-21 23:44:11,619 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-21 23:44:11,620 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-21 23:44:11,620 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-21 23:44:11,621 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-21 23:44:11,621 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-21 23:44:11,621 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-21 23:44:11,622 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-21 23:44:11,623 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-21 23:44:11,623 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-21 23:44:11,637 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-21 23:44:11,638 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-21 23:44:11,639 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-21 23:44:11,639 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-21 23:44:11,639 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-21 23:44:11,639 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-21 23:44:11,640 INFO L133 SettingsManager]: * Use SBE=true [2020-06-21 23:44:11,640 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-21 23:44:11,640 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-21 23:44:11,640 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-21 23:44:11,640 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-21 23:44:11,640 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-21 23:44:11,641 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-21 23:44:11,641 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-21 23:44:11,641 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:11,641 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-21 23:44:11,641 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-21 23:44:11,642 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-21 23:44:11,642 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-21 23:44:11,642 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-21 23:44:11,642 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-21 23:44:11,642 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-21 23:44:11,642 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-21 23:44:11,643 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-21 23:44:11,643 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-21 23:44:11,643 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-21 23:44:11,643 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-21 23:44:11,643 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-21 23:44:11,643 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-21 23:44:11,669 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-21 23:44:11,682 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-21 23:44:11,685 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-21 23:44:11,687 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-21 23:44:11,687 INFO L276 PluginConnector]: CDTParser initialized [2020-06-21 23:44:11,688 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-21 23:44:11,756 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/842dcbe86ff544ac9b8e1a7a46590d2b/FLAG45ac744f1 !SESSION 2020-06-21 23:44:09.261 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.cdt.core 1 0 2020-06-21 23:44:12.043 !MESSAGE Indexed 'FLAG45ac744f1' (0 sources, 0 headers) in 0.006 sec: 0 declarations; 0 references; 0 unresolved inclusions; 0 syntax errors; 0 unresolved names (0%) [2020-06-21 23:44:12,121 INFO L307 CDTParser]: Found 1 translation units. [2020-06-21 23:44:12,121 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-21 23:44:12,129 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/842dcbe86ff544ac9b8e1a7a46590d2b/FLAG45ac744f1 [2020-06-21 23:44:12,577 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/842dcbe86ff544ac9b8e1a7a46590d2b [2020-06-21 23:44:12,588 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-21 23:44:12,590 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-21 23:44:12,591 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-21 23:44:12,591 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-21 23:44:12,594 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-21 23:44:12,595 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.06 11:44:12" (1/1) ... [2020-06-21 23:44:12,598 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@172e8bdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 11:44:12, skipping insertion in model container [2020-06-21 23:44:12,599 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.06 11:44:12" (1/1) ... [2020-06-21 23:44:12,606 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-21 23:44:12,627 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-21 23:44:12,851 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-21 23:44:12,856 INFO L191 MainTranslator]: Completed pre-run [2020-06-21 23:44:12,878 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-21 23:44:12,893 INFO L195 MainTranslator]: Completed translation [2020-06-21 23:44:12,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 11:44:12 WrapperNode [2020-06-21 23:44:12,894 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-21 23:44:12,895 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-21 23:44:12,895 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-21 23:44:12,895 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-21 23:44:12,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 11:44:12" (1/1) ... [2020-06-21 23:44:12,911 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 11:44:12" (1/1) ... [2020-06-21 23:44:12,931 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-21 23:44:12,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-21 23:44:12,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-21 23:44:12,932 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-21 23:44:12,941 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 11:44:12" (1/1) ... [2020-06-21 23:44:12,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 11:44:12" (1/1) ... [2020-06-21 23:44:12,943 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 11:44:12" (1/1) ... [2020-06-21 23:44:12,943 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 11:44:12" (1/1) ... [2020-06-21 23:44:12,946 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 11:44:12" (1/1) ... [2020-06-21 23:44:12,949 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 11:44:12" (1/1) ... [2020-06-21 23:44:12,950 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 11:44:12" (1/1) ... [2020-06-21 23:44:12,952 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-21 23:44:12,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-21 23:44:12,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-21 23:44:12,952 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-21 23:44:12,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 11:44:12" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-21 23:44:13,019 INFO L130 BoogieDeclarations]: Found specification of procedure multiple_of [2020-06-21 23:44:13,019 INFO L138 BoogieDeclarations]: Found implementation of procedure multiple_of [2020-06-21 23:44:13,020 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2020-06-21 23:44:13,020 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2020-06-21 23:44:13,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-21 23:44:13,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-21 23:44:13,020 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime_ [2020-06-21 23:44:13,020 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime_ [2020-06-21 23:44:13,269 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-21 23:44:13,269 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2020-06-21 23:44:13,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.06 11:44:13 BoogieIcfgContainer [2020-06-21 23:44:13,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-21 23:44:13,271 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-21 23:44:13,271 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-21 23:44:13,273 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-21 23:44:13,274 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.06 11:44:13" (1/1) ... [2020-06-21 23:44:13,299 INFO L313 BlockEncoder]: Initial Icfg 49 locations, 71 edges [2020-06-21 23:44:13,301 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-21 23:44:13,302 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-21 23:44:13,302 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-21 23:44:13,303 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-21 23:44:13,304 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-21 23:44:13,305 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-21 23:44:13,306 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-21 23:44:13,331 INFO L185 BlockEncoder]: Using Use SBE [2020-06-21 23:44:13,359 INFO L200 BlockEncoder]: SBE split 12 edges [2020-06-21 23:44:13,364 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-21 23:44:13,366 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-21 23:44:13,375 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding [2020-06-21 23:44:13,378 INFO L70 RemoveSinkStates]: Removed 16 edges and 5 locations by removing sink states [2020-06-21 23:44:13,380 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-21 23:44:13,380 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-21 23:44:13,386 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding [2020-06-21 23:44:13,387 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-21 23:44:13,387 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-21 23:44:13,388 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-21 23:44:13,388 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-21 23:44:13,389 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-21 23:44:13,389 INFO L313 BlockEncoder]: Encoded RCFG 40 locations, 65 edges [2020-06-21 23:44:13,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 21.06 11:44:13 BasicIcfg [2020-06-21 23:44:13,390 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-21 23:44:13,391 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-21 23:44:13,391 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-21 23:44:13,396 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-21 23:44:13,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.06 11:44:12" (1/4) ... [2020-06-21 23:44:13,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c38186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.06 11:44:13, skipping insertion in model container [2020-06-21 23:44:13,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 11:44:12" (2/4) ... [2020-06-21 23:44:13,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c38186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.06 11:44:13, skipping insertion in model container [2020-06-21 23:44:13,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.06 11:44:13" (3/4) ... [2020-06-21 23:44:13,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c38186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.06 11:44:13, skipping insertion in model container [2020-06-21 23:44:13,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 21.06 11:44:13" (4/4) ... [2020-06-21 23:44:13,400 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-21 23:44:13,410 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-21 23:44:13,418 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-21 23:44:13,435 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-21 23:44:13,464 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-21 23:44:13,464 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-21 23:44:13,464 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-21 23:44:13,465 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-21 23:44:13,465 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-21 23:44:13,465 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-21 23:44:13,465 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-21 23:44:13,465 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-21 23:44:13,465 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-21 23:44:13,483 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2020-06-21 23:44:13,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-21 23:44:13,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 40 states. [2020-06-21 23:44:13,574 INFO L448 ceAbstractionStarter]: For program point L33(lines 33 35) no Hoare annotation was computed. [2020-06-21 23:44:13,574 INFO L448 ceAbstractionStarter]: For program point L34-1(line 34) no Hoare annotation was computed. [2020-06-21 23:44:13,574 INFO L451 ceAbstractionStarter]: At program point L31(line 31) the Hoare annotation is: true [2020-06-21 23:44:13,575 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 32) no Hoare annotation was computed. [2020-06-21 23:44:13,575 INFO L448 ceAbstractionStarter]: For program point L31-1(line 31) no Hoare annotation was computed. [2020-06-21 23:44:13,575 INFO L448 ceAbstractionStarter]: For program point multiple_ofFINAL(lines 29 43) no Hoare annotation was computed. [2020-06-21 23:44:13,575 INFO L451 ceAbstractionStarter]: At program point L42(line 42) the Hoare annotation is: true [2020-06-21 23:44:13,575 INFO L451 ceAbstractionStarter]: At program point multiple_ofENTRY(lines 29 43) the Hoare annotation is: true [2020-06-21 23:44:13,575 INFO L448 ceAbstractionStarter]: For program point L42-1(line 42) no Hoare annotation was computed. [2020-06-21 23:44:13,576 INFO L448 ceAbstractionStarter]: For program point L39(lines 39 41) no Hoare annotation was computed. [2020-06-21 23:44:13,576 INFO L448 ceAbstractionStarter]: For program point L36(lines 36 38) no Hoare annotation was computed. [2020-06-21 23:44:13,576 INFO L448 ceAbstractionStarter]: For program point multiple_ofEXIT(lines 29 43) no Hoare annotation was computed. [2020-06-21 23:44:13,576 INFO L451 ceAbstractionStarter]: At program point L34(line 34) the Hoare annotation is: true [2020-06-21 23:44:13,576 INFO L451 ceAbstractionStarter]: At program point L17(line 17) the Hoare annotation is: true [2020-06-21 23:44:13,576 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 18) no Hoare annotation was computed. [2020-06-21 23:44:13,577 INFO L448 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. [2020-06-21 23:44:13,577 INFO L451 ceAbstractionStarter]: At program point multENTRY(lines 15 26) the Hoare annotation is: true [2020-06-21 23:44:13,577 INFO L448 ceAbstractionStarter]: For program point multFINAL(lines 15 26) no Hoare annotation was computed. [2020-06-21 23:44:13,577 INFO L448 ceAbstractionStarter]: For program point multEXIT(lines 15 26) no Hoare annotation was computed. [2020-06-21 23:44:13,577 INFO L451 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: true [2020-06-21 23:44:13,577 INFO L448 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2020-06-21 23:44:13,577 INFO L448 ceAbstractionStarter]: For program point L22(lines 22 24) no Hoare annotation was computed. [2020-06-21 23:44:13,578 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 21) no Hoare annotation was computed. [2020-06-21 23:44:13,578 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-21 23:44:13,578 INFO L448 ceAbstractionStarter]: For program point L89(line 89) no Hoare annotation was computed. [2020-06-21 23:44:13,578 INFO L451 ceAbstractionStarter]: At program point L89-1(line 89) the Hoare annotation is: true [2020-06-21 23:44:13,578 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 87) no Hoare annotation was computed. [2020-06-21 23:44:13,578 INFO L451 ceAbstractionStarter]: At program point L51(line 51) the Hoare annotation is: true [2020-06-21 23:44:13,579 INFO L451 ceAbstractionStarter]: At program point L51-1(line 51) the Hoare annotation is: true [2020-06-21 23:44:13,579 INFO L448 ceAbstractionStarter]: For program point is_prime_EXIT(lines 55 72) no Hoare annotation was computed. [2020-06-21 23:44:13,579 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 66 68) no Hoare annotation was computed. [2020-06-21 23:44:13,579 INFO L448 ceAbstractionStarter]: For program point L63(lines 63 70) no Hoare annotation was computed. [2020-06-21 23:44:13,579 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 71) no Hoare annotation was computed. [2020-06-21 23:44:13,579 INFO L448 ceAbstractionStarter]: For program point is_prime_FINAL(lines 55 72) no Hoare annotation was computed. [2020-06-21 23:44:13,579 INFO L451 ceAbstractionStarter]: At program point is_prime_ENTRY(lines 55 72) the Hoare annotation is: true [2020-06-21 23:44:13,580 INFO L448 ceAbstractionStarter]: For program point L59(lines 59 61) no Hoare annotation was computed. [2020-06-21 23:44:13,580 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. [2020-06-21 23:44:13,580 INFO L451 ceAbstractionStarter]: At program point L69(line 69) the Hoare annotation is: true [2020-06-21 23:44:13,580 INFO L448 ceAbstractionStarter]: For program point L69-1(line 69) no Hoare annotation was computed. [2020-06-21 23:44:13,580 INFO L451 ceAbstractionStarter]: At program point L66(line 66) the Hoare annotation is: true [2020-06-21 23:44:13,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.06 11:44:13 BasicIcfg [2020-06-21 23:44:13,589 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-21 23:44:13,590 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-21 23:44:13,590 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-21 23:44:13,593 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-21 23:44:13,594 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-21 23:44:13,595 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.06 11:44:12" (1/5) ... [2020-06-21 23:44:13,595 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11b9d446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.06 11:44:13, skipping insertion in model container [2020-06-21 23:44:13,595 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-21 23:44:13,596 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 11:44:12" (2/5) ... [2020-06-21 23:44:13,596 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11b9d446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.06 11:44:13, skipping insertion in model container [2020-06-21 23:44:13,596 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-21 23:44:13,596 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.06 11:44:13" (3/5) ... [2020-06-21 23:44:13,596 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11b9d446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.06 11:44:13, skipping insertion in model container [2020-06-21 23:44:13,597 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-21 23:44:13,597 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 21.06 11:44:13" (4/5) ... [2020-06-21 23:44:13,597 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11b9d446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.06 11:44:13, skipping insertion in model container [2020-06-21 23:44:13,597 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-21 23:44:13,597 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.06 11:44:13" (5/5) ... [2020-06-21 23:44:13,599 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-21 23:44:13,626 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-21 23:44:13,627 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-21 23:44:13,627 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-21 23:44:13,627 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-21 23:44:13,627 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-21 23:44:13,627 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-21 23:44:13,628 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-21 23:44:13,628 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-21 23:44:13,628 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-21 23:44:13,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. [2020-06-21 23:44:13,655 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2020-06-21 23:44:13,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-21 23:44:13,655 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-21 23:44:13,663 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-21 23:44:13,663 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-21 23:44:13,664 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-21 23:44:13,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. [2020-06-21 23:44:13,668 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2020-06-21 23:44:13,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-21 23:44:13,668 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-21 23:44:13,668 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-21 23:44:13,669 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-21 23:44:13,674 INFO L794 eck$LassoCheckResult]: Stem: 33#ULTIMATE.startENTRYtrue [241] ULTIMATE.startENTRY-->L51: Formula: (and (= v_ULTIMATE.start_main_~n~0_7 |v_ULTIMATE.start_is_prime_#in~n_2|) (<= 1 v_ULTIMATE.start_main_~n~0_7) (<= v_ULTIMATE.start_main_~n~0_7 46340) (= v_ULTIMATE.start_is_prime_~n_5 |v_ULTIMATE.start_is_prime_#in~n_2|)) InVars {} OutVars{ULTIMATE.start_is_prime_#in~n=|v_ULTIMATE.start_is_prime_#in~n_2|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_5, ULTIMATE.start_is_prime_#res=|v_ULTIMATE.start_is_prime_#res_5|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_5, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_12, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_8|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_5|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_10|, ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_7, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_8|} AuxVars[] AssignedVars[ULTIMATE.start_is_prime_#in~n, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_is_prime_~n, ULTIMATE.start_is_prime_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~result~0, ULTIMATE.start_main_~f1~0, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_#t~short13, ULTIMATE.start_main_~f2~0, ULTIMATE.start_is_prime_#t~ret5] 11#L51true [130] L51-->is_prime_ENTRY: Formula: (and (= |v_is_prime__#in~mInParam_1| (+ v_ULTIMATE.start_is_prime_~n_4 (- 1))) (= |v_is_prime__#in~nInParam_1| v_ULTIMATE.start_is_prime_~n_4)) InVars {ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_4} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_1|, is_prime__#in~n=|v_is_prime__#in~nInParam_1|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n]< 12#is_prime_ENTRYtrue [2020-06-21 23:44:13,675 INFO L796 eck$LassoCheckResult]: Loop: 12#is_prime_ENTRYtrue [131] is_prime_ENTRY-->L56: Formula: (and (= v_is_prime__~n_4 |v_is_prime__#in~n_1|) (= v_is_prime__~m_4 |v_is_prime__#in~m_1|)) InVars {is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} OutVars{is_prime__~n=v_is_prime__~n_4, is_prime__~m=v_is_prime__~m_4, is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} AuxVars[] AssignedVars[is_prime__~n, is_prime__~m] 15#L56true [196] L56-->L59: Formula: (> v_is_prime__~n_6 1) InVars {is_prime__~n=v_is_prime__~n_6} OutVars{is_prime__~n=v_is_prime__~n_6} AuxVars[] AssignedVars[] 6#L59true [214] L59-->L62: Formula: (> 2 v_is_prime__~n_8) InVars {is_prime__~n=v_is_prime__~n_8} OutVars{is_prime__~n=v_is_prime__~n_8} AuxVars[] AssignedVars[] 30#L62true [148] L62-->L63: Formula: (< 2 v_is_prime__~n_9) InVars {is_prime__~n=v_is_prime__~n_9} OutVars{is_prime__~n=v_is_prime__~n_9} AuxVars[] AssignedVars[] 14#L63true [199] L63-->L66: Formula: (> v_is_prime__~m_1 1) InVars {is_prime__~m=v_is_prime__~m_1} OutVars{is_prime__~m=v_is_prime__~m_1} AuxVars[] AssignedVars[] 37#L66true [158] L66-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~mInParam_4| v_is_prime__~m_6) (= |v_multiple_of_#in~nInParam_4| v_is_prime__~n_10)) InVars {is_prime__~n=v_is_prime__~n_10, is_prime__~m=v_is_prime__~m_6} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_4|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_4|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 40#multiple_ofENTRYtrue [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 36#L30true [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 26#L33true [203] L33-->L36: Formula: (>= v_multiple_of_~n_5 0) InVars {multiple_of_~n=v_multiple_of_~n_5} OutVars{multiple_of_~n=v_multiple_of_~n_5} AuxVars[] AssignedVars[] 9#L36true [164] L36-->multiple_ofFINAL: Formula: (and (= 0 v_multiple_of_~m_6) (= |v_multiple_of_#res_3| 0)) InVars {multiple_of_~m=v_multiple_of_~m_6} OutVars{multiple_of_~m=v_multiple_of_~m_6, multiple_of_#res=|v_multiple_of_#res_3|} AuxVars[] AssignedVars[multiple_of_#res] 31#multiple_ofFINALtrue [150] multiple_ofFINAL-->multiple_ofEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 29#multiple_ofEXITtrue >[191] multiple_ofEXIT-->L66-1: AOR: Formula: (= |v_is_prime__#t~ret6_6| |v_multiple_of_#resOutParam_4|) InVars {multiple_of_#res=|v_multiple_of_#resOutParam_4|} OutVars{is_prime__#t~ret6=|v_is_prime__#t~ret6_6|} AuxVars[] AssignedVars[is_prime__#t~ret6] LVA: Formula: (and (= |v_multiple_of_#in~mInParam_4| v_is_prime__~m_6) (= |v_multiple_of_#in~nInParam_4| v_is_prime__~n_10)) InVars {is_prime__~n=v_is_prime__~n_10, is_prime__~m=v_is_prime__~m_6} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_4|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_4|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n] 35#L66-1true [232] L66-1-->L69: Formula: (> 0 |v_is_prime__#t~ret6_5|) InVars {is_prime__#t~ret6=|v_is_prime__#t~ret6_5|} OutVars{is_prime__#t~ret6=|v_is_prime__#t~ret6_4|} AuxVars[] AssignedVars[is_prime__#t~ret6] 27#L69true [144] L69-->is_prime_ENTRY: Formula: (and (= |v_is_prime__#in~nInParam_2| v_is_prime__~n_11) (= |v_is_prime__#in~mInParam_2| (+ v_is_prime__~m_7 (- 1)))) InVars {is_prime__~n=v_is_prime__~n_11, is_prime__~m=v_is_prime__~m_7} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_2|, is_prime__#in~n=|v_is_prime__#in~nInParam_2|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n]< 12#is_prime_ENTRYtrue [2020-06-21 23:44:13,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:44:13,680 INFO L82 PathProgramCache]: Analyzing trace with hash 8562, now seen corresponding path program 1 times [2020-06-21 23:44:13,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:44:13,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:44:13,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:13,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 23:44:13,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:13,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:44:13,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1479560046, now seen corresponding path program 1 times [2020-06-21 23:44:13,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:44:13,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:44:13,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:13,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 23:44:13,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:13,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:44:13,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-21 23:44:13,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-21 23:44:13,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-21 23:44:13,814 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-21 23:44:13,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-21 23:44:13,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-21 23:44:13,830 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2020-06-21 23:44:13,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-21 23:44:13,910 INFO L93 Difference]: Finished difference Result 42 states and 67 transitions. [2020-06-21 23:44:13,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-21 23:44:13,914 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 67 transitions. [2020-06-21 23:44:13,919 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2020-06-21 23:44:13,926 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 38 states and 60 transitions. [2020-06-21 23:44:13,928 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2020-06-21 23:44:13,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2020-06-21 23:44:13,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 60 transitions. [2020-06-21 23:44:13,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-21 23:44:13,931 INFO L706 BuchiCegarLoop]: Abstraction has 38 states and 60 transitions. [2020-06-21 23:44:13,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 60 transitions. [2020-06-21 23:44:13,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2020-06-21 23:44:13,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-06-21 23:44:13,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 57 transitions. [2020-06-21 23:44:13,966 INFO L729 BuchiCegarLoop]: Abstraction has 36 states and 57 transitions. [2020-06-21 23:44:13,966 INFO L609 BuchiCegarLoop]: Abstraction has 36 states and 57 transitions. [2020-06-21 23:44:13,966 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-21 23:44:13,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 57 transitions. [2020-06-21 23:44:13,968 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2020-06-21 23:44:13,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-21 23:44:13,968 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-21 23:44:13,968 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-21 23:44:13,968 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-21 23:44:13,969 INFO L794 eck$LassoCheckResult]: Stem: 124#ULTIMATE.startENTRY [241] ULTIMATE.startENTRY-->L51: Formula: (and (= v_ULTIMATE.start_main_~n~0_7 |v_ULTIMATE.start_is_prime_#in~n_2|) (<= 1 v_ULTIMATE.start_main_~n~0_7) (<= v_ULTIMATE.start_main_~n~0_7 46340) (= v_ULTIMATE.start_is_prime_~n_5 |v_ULTIMATE.start_is_prime_#in~n_2|)) InVars {} OutVars{ULTIMATE.start_is_prime_#in~n=|v_ULTIMATE.start_is_prime_#in~n_2|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_5, ULTIMATE.start_is_prime_#res=|v_ULTIMATE.start_is_prime_#res_5|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_5, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_12, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_8|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_5|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_10|, ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_7, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_8|} AuxVars[] AssignedVars[ULTIMATE.start_is_prime_#in~n, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_is_prime_~n, ULTIMATE.start_is_prime_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~result~0, ULTIMATE.start_main_~f1~0, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_#t~short13, ULTIMATE.start_main_~f2~0, ULTIMATE.start_is_prime_#t~ret5] 105#L51 [130] L51-->is_prime_ENTRY: Formula: (and (= |v_is_prime__#in~mInParam_1| (+ v_ULTIMATE.start_is_prime_~n_4 (- 1))) (= |v_is_prime__#in~nInParam_1| v_ULTIMATE.start_is_prime_~n_4)) InVars {ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_4} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_1|, is_prime__#in~n=|v_is_prime__#in~nInParam_1|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n]< 113#is_prime_ENTRY [2020-06-21 23:44:13,970 INFO L796 eck$LassoCheckResult]: Loop: 113#is_prime_ENTRY [131] is_prime_ENTRY-->L56: Formula: (and (= v_is_prime__~n_4 |v_is_prime__#in~n_1|) (= v_is_prime__~m_4 |v_is_prime__#in~m_1|)) InVars {is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} OutVars{is_prime__~n=v_is_prime__~n_4, is_prime__~m=v_is_prime__~m_4, is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} AuxVars[] AssignedVars[is_prime__~n, is_prime__~m] 114#L56 [196] L56-->L59: Formula: (> v_is_prime__~n_6 1) InVars {is_prime__~n=v_is_prime__~n_6} OutVars{is_prime__~n=v_is_prime__~n_6} AuxVars[] AssignedVars[] 103#L59 [215] L59-->L62: Formula: (< 2 v_is_prime__~n_8) InVars {is_prime__~n=v_is_prime__~n_8} OutVars{is_prime__~n=v_is_prime__~n_8} AuxVars[] AssignedVars[] 107#L62 [148] L62-->L63: Formula: (< 2 v_is_prime__~n_9) InVars {is_prime__~n=v_is_prime__~n_9} OutVars{is_prime__~n=v_is_prime__~n_9} AuxVars[] AssignedVars[] 116#L63 [199] L63-->L66: Formula: (> v_is_prime__~m_1 1) InVars {is_prime__~m=v_is_prime__~m_1} OutVars{is_prime__~m=v_is_prime__~m_1} AuxVars[] AssignedVars[] 93#L66 [158] L66-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~mInParam_4| v_is_prime__~m_6) (= |v_multiple_of_#in~nInParam_4| v_is_prime__~n_10)) InVars {is_prime__~n=v_is_prime__~n_10, is_prime__~m=v_is_prime__~m_6} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_4|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_4|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 102#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 125#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 121#L33 [203] L33-->L36: Formula: (>= v_multiple_of_~n_5 0) InVars {multiple_of_~n=v_multiple_of_~n_5} OutVars{multiple_of_~n=v_multiple_of_~n_5} AuxVars[] AssignedVars[] 111#L36 [164] L36-->multiple_ofFINAL: Formula: (and (= 0 v_multiple_of_~m_6) (= |v_multiple_of_#res_3| 0)) InVars {multiple_of_~m=v_multiple_of_~m_6} OutVars{multiple_of_~m=v_multiple_of_~m_6, multiple_of_#res=|v_multiple_of_#res_3|} AuxVars[] AssignedVars[multiple_of_#res] 96#multiple_ofFINAL [150] multiple_ofFINAL-->multiple_ofEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 122#multiple_ofEXIT >[191] multiple_ofEXIT-->L66-1: AOR: Formula: (= |v_is_prime__#t~ret6_6| |v_multiple_of_#resOutParam_4|) InVars {multiple_of_#res=|v_multiple_of_#resOutParam_4|} OutVars{is_prime__#t~ret6=|v_is_prime__#t~ret6_6|} AuxVars[] AssignedVars[is_prime__#t~ret6] LVA: Formula: (and (= |v_multiple_of_#in~mInParam_4| v_is_prime__~m_6) (= |v_multiple_of_#in~nInParam_4| v_is_prime__~n_10)) InVars {is_prime__~n=v_is_prime__~n_10, is_prime__~m=v_is_prime__~m_6} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_4|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_4|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n] 123#L66-1 [232] L66-1-->L69: Formula: (> 0 |v_is_prime__#t~ret6_5|) InVars {is_prime__#t~ret6=|v_is_prime__#t~ret6_5|} OutVars{is_prime__#t~ret6=|v_is_prime__#t~ret6_4|} AuxVars[] AssignedVars[is_prime__#t~ret6] 104#L69 [144] L69-->is_prime_ENTRY: Formula: (and (= |v_is_prime__#in~nInParam_2| v_is_prime__~n_11) (= |v_is_prime__#in~mInParam_2| (+ v_is_prime__~m_7 (- 1)))) InVars {is_prime__~n=v_is_prime__~n_11, is_prime__~m=v_is_prime__~m_7} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_2|, is_prime__#in~n=|v_is_prime__#in~nInParam_2|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n]< 113#is_prime_ENTRY [2020-06-21 23:44:13,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:44:13,970 INFO L82 PathProgramCache]: Analyzing trace with hash 8562, now seen corresponding path program 2 times [2020-06-21 23:44:13,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:44:13,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:44:13,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:13,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 23:44:13,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:13,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:13,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:44:13,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1350477327, now seen corresponding path program 1 times [2020-06-21 23:44:13,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:44:13,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:44:13,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:13,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-21 23:44:13,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:44:14,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-21 23:44:14,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-21 23:44:14,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-21 23:44:14,026 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-21 23:44:14,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-21 23:44:14,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-21 23:44:14,026 INFO L87 Difference]: Start difference. First operand 36 states and 57 transitions. cyclomatic complexity: 24 Second operand 5 states. [2020-06-21 23:44:14,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-21 23:44:14,268 INFO L93 Difference]: Finished difference Result 49 states and 80 transitions. [2020-06-21 23:44:14,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-21 23:44:14,270 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 80 transitions. [2020-06-21 23:44:14,272 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2020-06-21 23:44:14,275 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 44 states and 67 transitions. [2020-06-21 23:44:14,275 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2020-06-21 23:44:14,275 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2020-06-21 23:44:14,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 67 transitions. [2020-06-21 23:44:14,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-21 23:44:14,277 INFO L706 BuchiCegarLoop]: Abstraction has 44 states and 67 transitions. [2020-06-21 23:44:14,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 67 transitions. [2020-06-21 23:44:14,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-06-21 23:44:14,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-06-21 23:44:14,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 64 transitions. [2020-06-21 23:44:14,282 INFO L729 BuchiCegarLoop]: Abstraction has 42 states and 64 transitions. [2020-06-21 23:44:14,282 INFO L609 BuchiCegarLoop]: Abstraction has 42 states and 64 transitions. [2020-06-21 23:44:14,282 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-21 23:44:14,282 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 64 transitions. [2020-06-21 23:44:14,283 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2020-06-21 23:44:14,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-21 23:44:14,284 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-21 23:44:14,284 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-21 23:44:14,284 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-21 23:44:14,285 INFO L794 eck$LassoCheckResult]: Stem: 221#ULTIMATE.startENTRY [241] ULTIMATE.startENTRY-->L51: Formula: (and (= v_ULTIMATE.start_main_~n~0_7 |v_ULTIMATE.start_is_prime_#in~n_2|) (<= 1 v_ULTIMATE.start_main_~n~0_7) (<= v_ULTIMATE.start_main_~n~0_7 46340) (= v_ULTIMATE.start_is_prime_~n_5 |v_ULTIMATE.start_is_prime_#in~n_2|)) InVars {} OutVars{ULTIMATE.start_is_prime_#in~n=|v_ULTIMATE.start_is_prime_#in~n_2|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_5, ULTIMATE.start_is_prime_#res=|v_ULTIMATE.start_is_prime_#res_5|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_5, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_12, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_8|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_5|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_10|, ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_7, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_8|} AuxVars[] AssignedVars[ULTIMATE.start_is_prime_#in~n, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_is_prime_~n, ULTIMATE.start_is_prime_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~result~0, ULTIMATE.start_main_~f1~0, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_#t~short13, ULTIMATE.start_main_~f2~0, ULTIMATE.start_is_prime_#t~ret5] 201#L51 [130] L51-->is_prime_ENTRY: Formula: (and (= |v_is_prime__#in~mInParam_1| (+ v_ULTIMATE.start_is_prime_~n_4 (- 1))) (= |v_is_prime__#in~nInParam_1| v_ULTIMATE.start_is_prime_~n_4)) InVars {ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_4} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_1|, is_prime__#in~n=|v_is_prime__#in~nInParam_1|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n]< 210#is_prime_ENTRY [2020-06-21 23:44:14,285 INFO L796 eck$LassoCheckResult]: Loop: 210#is_prime_ENTRY [131] is_prime_ENTRY-->L56: Formula: (and (= v_is_prime__~n_4 |v_is_prime__#in~n_1|) (= v_is_prime__~m_4 |v_is_prime__#in~m_1|)) InVars {is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} OutVars{is_prime__~n=v_is_prime__~n_4, is_prime__~m=v_is_prime__~m_4, is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} AuxVars[] AssignedVars[is_prime__~n, is_prime__~m] 211#L56 [196] L56-->L59: Formula: (> v_is_prime__~n_6 1) InVars {is_prime__~n=v_is_prime__~n_6} OutVars{is_prime__~n=v_is_prime__~n_6} AuxVars[] AssignedVars[] 200#L59 [215] L59-->L62: Formula: (< 2 v_is_prime__~n_8) InVars {is_prime__~n=v_is_prime__~n_8} OutVars{is_prime__~n=v_is_prime__~n_8} AuxVars[] AssignedVars[] 204#L62 [148] L62-->L63: Formula: (< 2 v_is_prime__~n_9) InVars {is_prime__~n=v_is_prime__~n_9} OutVars{is_prime__~n=v_is_prime__~n_9} AuxVars[] AssignedVars[] 213#L63 [199] L63-->L66: Formula: (> v_is_prime__~m_1 1) InVars {is_prime__~m=v_is_prime__~m_1} OutVars{is_prime__~m=v_is_prime__~m_1} AuxVars[] AssignedVars[] 187#L66 [158] L66-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~mInParam_4| v_is_prime__~m_6) (= |v_multiple_of_#in~nInParam_4| v_is_prime__~n_10)) InVars {is_prime__~n=v_is_prime__~n_10, is_prime__~m=v_is_prime__~m_6} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_4|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_4|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 216#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 226#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 224#L33 [203] L33-->L36: Formula: (>= v_multiple_of_~n_5 0) InVars {multiple_of_~n=v_multiple_of_~n_5} OutVars{multiple_of_~n=v_multiple_of_~n_5} AuxVars[] AssignedVars[] 225#L36 [226] L36-->L39: Formula: (< 0 v_multiple_of_~m_7) InVars {multiple_of_~m=v_multiple_of_~m_7} OutVars{multiple_of_~m=v_multiple_of_~m_7} AuxVars[] AssignedVars[] 227#L39 [183] L39-->multiple_ofFINAL: Formula: (and (= 0 v_multiple_of_~n_6) (= |v_multiple_of_#res_4| 1)) InVars {multiple_of_~n=v_multiple_of_~n_6} OutVars{multiple_of_~n=v_multiple_of_~n_6, multiple_of_#res=|v_multiple_of_#res_4|} AuxVars[] AssignedVars[multiple_of_#res] 191#multiple_ofFINAL [150] multiple_ofFINAL-->multiple_ofEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 219#multiple_ofEXIT >[191] multiple_ofEXIT-->L66-1: AOR: Formula: (= |v_is_prime__#t~ret6_6| |v_multiple_of_#resOutParam_4|) InVars {multiple_of_#res=|v_multiple_of_#resOutParam_4|} OutVars{is_prime__#t~ret6=|v_is_prime__#t~ret6_6|} AuxVars[] AssignedVars[is_prime__#t~ret6] LVA: Formula: (and (= |v_multiple_of_#in~mInParam_4| v_is_prime__~m_6) (= |v_multiple_of_#in~nInParam_4| v_is_prime__~n_10)) InVars {is_prime__~n=v_is_prime__~n_10, is_prime__~m=v_is_prime__~m_6} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_4|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_4|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n] 220#L66-1 [232] L66-1-->L69: Formula: (> 0 |v_is_prime__#t~ret6_5|) InVars {is_prime__#t~ret6=|v_is_prime__#t~ret6_5|} OutVars{is_prime__#t~ret6=|v_is_prime__#t~ret6_4|} AuxVars[] AssignedVars[is_prime__#t~ret6] 202#L69 [144] L69-->is_prime_ENTRY: Formula: (and (= |v_is_prime__#in~nInParam_2| v_is_prime__~n_11) (= |v_is_prime__#in~mInParam_2| (+ v_is_prime__~m_7 (- 1)))) InVars {is_prime__~n=v_is_prime__~n_11, is_prime__~m=v_is_prime__~m_7} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_2|, is_prime__#in~n=|v_is_prime__#in~nInParam_2|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n]< 210#is_prime_ENTRY [2020-06-21 23:44:14,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:44:14,286 INFO L82 PathProgramCache]: Analyzing trace with hash 8562, now seen corresponding path program 3 times [2020-06-21 23:44:14,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:44:14,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:44:14,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:14,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 23:44:14,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:14,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:44:14,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1405865878, now seen corresponding path program 1 times [2020-06-21 23:44:14,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:44:14,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:44:14,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:14,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-21 23:44:14,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:44:14,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-21 23:44:14,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-21 23:44:14,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-21 23:44:14,328 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-21 23:44:14,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-21 23:44:14,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-21 23:44:14,329 INFO L87 Difference]: Start difference. First operand 42 states and 64 transitions. cyclomatic complexity: 25 Second operand 5 states. [2020-06-21 23:44:14,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-21 23:44:14,453 INFO L93 Difference]: Finished difference Result 49 states and 74 transitions. [2020-06-21 23:44:14,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-21 23:44:14,454 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 74 transitions. [2020-06-21 23:44:14,456 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 31 [2020-06-21 23:44:14,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 74 transitions. [2020-06-21 23:44:14,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2020-06-21 23:44:14,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2020-06-21 23:44:14,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 74 transitions. [2020-06-21 23:44:14,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-21 23:44:14,460 INFO L706 BuchiCegarLoop]: Abstraction has 49 states and 74 transitions. [2020-06-21 23:44:14,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 74 transitions. [2020-06-21 23:44:14,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2020-06-21 23:44:14,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-06-21 23:44:14,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 70 transitions. [2020-06-21 23:44:14,466 INFO L729 BuchiCegarLoop]: Abstraction has 46 states and 70 transitions. [2020-06-21 23:44:14,466 INFO L609 BuchiCegarLoop]: Abstraction has 46 states and 70 transitions. [2020-06-21 23:44:14,466 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-21 23:44:14,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 70 transitions. [2020-06-21 23:44:14,468 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 30 [2020-06-21 23:44:14,468 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-21 23:44:14,468 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-21 23:44:14,469 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-21 23:44:14,469 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-21 23:44:14,469 INFO L794 eck$LassoCheckResult]: Stem: 323#ULTIMATE.startENTRY [241] ULTIMATE.startENTRY-->L51: Formula: (and (= v_ULTIMATE.start_main_~n~0_7 |v_ULTIMATE.start_is_prime_#in~n_2|) (<= 1 v_ULTIMATE.start_main_~n~0_7) (<= v_ULTIMATE.start_main_~n~0_7 46340) (= v_ULTIMATE.start_is_prime_~n_5 |v_ULTIMATE.start_is_prime_#in~n_2|)) InVars {} OutVars{ULTIMATE.start_is_prime_#in~n=|v_ULTIMATE.start_is_prime_#in~n_2|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_5, ULTIMATE.start_is_prime_#res=|v_ULTIMATE.start_is_prime_#res_5|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_5, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_12, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_8|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_5|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_10|, ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_7, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_8|} AuxVars[] AssignedVars[ULTIMATE.start_is_prime_#in~n, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_is_prime_~n, ULTIMATE.start_is_prime_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~result~0, ULTIMATE.start_main_~f1~0, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_#t~short13, ULTIMATE.start_main_~f2~0, ULTIMATE.start_is_prime_#t~ret5] 303#L51 [130] L51-->is_prime_ENTRY: Formula: (and (= |v_is_prime__#in~mInParam_1| (+ v_ULTIMATE.start_is_prime_~n_4 (- 1))) (= |v_is_prime__#in~nInParam_1| v_ULTIMATE.start_is_prime_~n_4)) InVars {ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_4} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_1|, is_prime__#in~n=|v_is_prime__#in~nInParam_1|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n]< 312#is_prime_ENTRY [2020-06-21 23:44:14,470 INFO L796 eck$LassoCheckResult]: Loop: 312#is_prime_ENTRY [131] is_prime_ENTRY-->L56: Formula: (and (= v_is_prime__~n_4 |v_is_prime__#in~n_1|) (= v_is_prime__~m_4 |v_is_prime__#in~m_1|)) InVars {is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} OutVars{is_prime__~n=v_is_prime__~n_4, is_prime__~m=v_is_prime__~m_4, is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} AuxVars[] AssignedVars[is_prime__~n, is_prime__~m] 313#L56 [196] L56-->L59: Formula: (> v_is_prime__~n_6 1) InVars {is_prime__~n=v_is_prime__~n_6} OutVars{is_prime__~n=v_is_prime__~n_6} AuxVars[] AssignedVars[] 302#L59 [215] L59-->L62: Formula: (< 2 v_is_prime__~n_8) InVars {is_prime__~n=v_is_prime__~n_8} OutVars{is_prime__~n=v_is_prime__~n_8} AuxVars[] AssignedVars[] 306#L62 [148] L62-->L63: Formula: (< 2 v_is_prime__~n_9) InVars {is_prime__~n=v_is_prime__~n_9} OutVars{is_prime__~n=v_is_prime__~n_9} AuxVars[] AssignedVars[] 315#L63 [199] L63-->L66: Formula: (> v_is_prime__~m_1 1) InVars {is_prime__~m=v_is_prime__~m_1} OutVars{is_prime__~m=v_is_prime__~m_1} AuxVars[] AssignedVars[] 291#L66 [158] L66-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~mInParam_4| v_is_prime__~m_6) (= |v_multiple_of_#in~nInParam_4| v_is_prime__~n_10)) InVars {is_prime__~n=v_is_prime__~n_10, is_prime__~m=v_is_prime__~m_6} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_4|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_4|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 318#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 330#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 327#L33 [203] L33-->L36: Formula: (>= v_multiple_of_~n_5 0) InVars {multiple_of_~n=v_multiple_of_~n_5} OutVars{multiple_of_~n=v_multiple_of_~n_5} AuxVars[] AssignedVars[] 328#L36 [226] L36-->L39: Formula: (< 0 v_multiple_of_~m_7) InVars {multiple_of_~m=v_multiple_of_~m_7} OutVars{multiple_of_~m=v_multiple_of_~m_7} AuxVars[] AssignedVars[] 332#L39 [228] L39-->L42: Formula: (< 0 v_multiple_of_~n_7) InVars {multiple_of_~n=v_multiple_of_~n_7} OutVars{multiple_of_~n=v_multiple_of_~n_7} AuxVars[] AssignedVars[] 288#L42 [141] L42-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~nInParam_3| (+ v_multiple_of_~n_11 (* (- 1) v_multiple_of_~m_11))) (= |v_multiple_of_#in~mInParam_3| v_multiple_of_~m_11)) InVars {multiple_of_~m=v_multiple_of_~m_11, multiple_of_~n=v_multiple_of_~n_11} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_3|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_3|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 318#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 330#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 327#L33 [203] L33-->L36: Formula: (>= v_multiple_of_~n_5 0) InVars {multiple_of_~n=v_multiple_of_~n_5} OutVars{multiple_of_~n=v_multiple_of_~n_5} AuxVars[] AssignedVars[] 328#L36 [226] L36-->L39: Formula: (< 0 v_multiple_of_~m_7) InVars {multiple_of_~m=v_multiple_of_~m_7} OutVars{multiple_of_~m=v_multiple_of_~m_7} AuxVars[] AssignedVars[] 332#L39 [183] L39-->multiple_ofFINAL: Formula: (and (= 0 v_multiple_of_~n_6) (= |v_multiple_of_#res_4| 1)) InVars {multiple_of_~n=v_multiple_of_~n_6} OutVars{multiple_of_~n=v_multiple_of_~n_6, multiple_of_#res=|v_multiple_of_#res_4|} AuxVars[] AssignedVars[multiple_of_#res] 293#multiple_ofFINAL [150] multiple_ofFINAL-->multiple_ofEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 321#multiple_ofEXIT >[186] multiple_ofEXIT-->L42-1: AOR: Formula: (= |v_multiple_of_#t~ret4_4| |v_multiple_of_#resOutParam_3|) InVars {multiple_of_#res=|v_multiple_of_#resOutParam_3|} OutVars{multiple_of_#t~ret4=|v_multiple_of_#t~ret4_4|} AuxVars[] AssignedVars[multiple_of_#t~ret4] LVA: Formula: (and (= |v_multiple_of_#in~nInParam_3| (+ v_multiple_of_~n_11 (* (- 1) v_multiple_of_~m_11))) (= |v_multiple_of_#in~mInParam_3| v_multiple_of_~m_11)) InVars {multiple_of_~m=v_multiple_of_~m_11, multiple_of_~n=v_multiple_of_~n_11} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_3|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_3|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n] 322#L42-1 [135] L42-1-->multiple_ofFINAL: Formula: (= |v_multiple_of_#res_5| |v_multiple_of_#t~ret4_3|) InVars {multiple_of_#t~ret4=|v_multiple_of_#t~ret4_3|} OutVars{multiple_of_#t~ret4=|v_multiple_of_#t~ret4_2|, multiple_of_#res=|v_multiple_of_#res_5|} AuxVars[] AssignedVars[multiple_of_#t~ret4, multiple_of_#res] 331#multiple_ofFINAL [150] multiple_ofFINAL-->multiple_ofEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 329#multiple_ofEXIT >[191] multiple_ofEXIT-->L66-1: AOR: Formula: (= |v_is_prime__#t~ret6_6| |v_multiple_of_#resOutParam_4|) InVars {multiple_of_#res=|v_multiple_of_#resOutParam_4|} OutVars{is_prime__#t~ret6=|v_is_prime__#t~ret6_6|} AuxVars[] AssignedVars[is_prime__#t~ret6] LVA: Formula: (and (= |v_multiple_of_#in~mInParam_4| v_is_prime__~m_6) (= |v_multiple_of_#in~nInParam_4| v_is_prime__~n_10)) InVars {is_prime__~n=v_is_prime__~n_10, is_prime__~m=v_is_prime__~m_6} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_4|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_4|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n] 324#L66-1 [232] L66-1-->L69: Formula: (> 0 |v_is_prime__#t~ret6_5|) InVars {is_prime__#t~ret6=|v_is_prime__#t~ret6_5|} OutVars{is_prime__#t~ret6=|v_is_prime__#t~ret6_4|} AuxVars[] AssignedVars[is_prime__#t~ret6] 304#L69 [144] L69-->is_prime_ENTRY: Formula: (and (= |v_is_prime__#in~nInParam_2| v_is_prime__~n_11) (= |v_is_prime__#in~mInParam_2| (+ v_is_prime__~m_7 (- 1)))) InVars {is_prime__~n=v_is_prime__~n_11, is_prime__~m=v_is_prime__~m_7} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_2|, is_prime__#in~n=|v_is_prime__#in~nInParam_2|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n]< 312#is_prime_ENTRY [2020-06-21 23:44:14,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:44:14,470 INFO L82 PathProgramCache]: Analyzing trace with hash 8562, now seen corresponding path program 4 times [2020-06-21 23:44:14,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:44:14,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:44:14,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:14,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 23:44:14,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:14,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:14,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:44:14,480 INFO L82 PathProgramCache]: Analyzing trace with hash 564447436, now seen corresponding path program 1 times [2020-06-21 23:44:14,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:44:14,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:44:14,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:14,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-21 23:44:14,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:44:14,533 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-06-21 23:44:14,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-21 23:44:14,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-21 23:44:14,535 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-21 23:44:14,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-21 23:44:14,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-21 23:44:14,535 INFO L87 Difference]: Start difference. First operand 46 states and 70 transitions. cyclomatic complexity: 27 Second operand 5 states. [2020-06-21 23:44:14,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-21 23:44:14,604 INFO L93 Difference]: Finished difference Result 53 states and 82 transitions. [2020-06-21 23:44:14,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-21 23:44:14,605 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 82 transitions. [2020-06-21 23:44:14,608 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 31 [2020-06-21 23:44:14,610 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 82 transitions. [2020-06-21 23:44:14,610 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2020-06-21 23:44:14,611 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2020-06-21 23:44:14,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 82 transitions. [2020-06-21 23:44:14,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-21 23:44:14,612 INFO L706 BuchiCegarLoop]: Abstraction has 53 states and 82 transitions. [2020-06-21 23:44:14,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 82 transitions. [2020-06-21 23:44:14,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-06-21 23:44:14,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-06-21 23:44:14,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 82 transitions. [2020-06-21 23:44:14,619 INFO L729 BuchiCegarLoop]: Abstraction has 53 states and 82 transitions. [2020-06-21 23:44:14,619 INFO L609 BuchiCegarLoop]: Abstraction has 53 states and 82 transitions. [2020-06-21 23:44:14,619 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-21 23:44:14,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 82 transitions. [2020-06-21 23:44:14,621 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 31 [2020-06-21 23:44:14,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-21 23:44:14,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-21 23:44:14,622 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-21 23:44:14,623 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-21 23:44:14,623 INFO L794 eck$LassoCheckResult]: Stem: 431#ULTIMATE.startENTRY [241] ULTIMATE.startENTRY-->L51: Formula: (and (= v_ULTIMATE.start_main_~n~0_7 |v_ULTIMATE.start_is_prime_#in~n_2|) (<= 1 v_ULTIMATE.start_main_~n~0_7) (<= v_ULTIMATE.start_main_~n~0_7 46340) (= v_ULTIMATE.start_is_prime_~n_5 |v_ULTIMATE.start_is_prime_#in~n_2|)) InVars {} OutVars{ULTIMATE.start_is_prime_#in~n=|v_ULTIMATE.start_is_prime_#in~n_2|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_5, ULTIMATE.start_is_prime_#res=|v_ULTIMATE.start_is_prime_#res_5|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_5, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_12, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_8|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_5|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_10|, ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_7, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_8|} AuxVars[] AssignedVars[ULTIMATE.start_is_prime_#in~n, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_is_prime_~n, ULTIMATE.start_is_prime_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~result~0, ULTIMATE.start_main_~f1~0, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_#t~short13, ULTIMATE.start_main_~f2~0, ULTIMATE.start_is_prime_#t~ret5] 410#L51 [130] L51-->is_prime_ENTRY: Formula: (and (= |v_is_prime__#in~mInParam_1| (+ v_ULTIMATE.start_is_prime_~n_4 (- 1))) (= |v_is_prime__#in~nInParam_1| v_ULTIMATE.start_is_prime_~n_4)) InVars {ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_4} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_1|, is_prime__#in~n=|v_is_prime__#in~nInParam_1|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n]< 419#is_prime_ENTRY [2020-06-21 23:44:14,624 INFO L796 eck$LassoCheckResult]: Loop: 419#is_prime_ENTRY [131] is_prime_ENTRY-->L56: Formula: (and (= v_is_prime__~n_4 |v_is_prime__#in~n_1|) (= v_is_prime__~m_4 |v_is_prime__#in~m_1|)) InVars {is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} OutVars{is_prime__~n=v_is_prime__~n_4, is_prime__~m=v_is_prime__~m_4, is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} AuxVars[] AssignedVars[is_prime__~n, is_prime__~m] 420#L56 [196] L56-->L59: Formula: (> v_is_prime__~n_6 1) InVars {is_prime__~n=v_is_prime__~n_6} OutVars{is_prime__~n=v_is_prime__~n_6} AuxVars[] AssignedVars[] 409#L59 [215] L59-->L62: Formula: (< 2 v_is_prime__~n_8) InVars {is_prime__~n=v_is_prime__~n_8} OutVars{is_prime__~n=v_is_prime__~n_8} AuxVars[] AssignedVars[] 413#L62 [148] L62-->L63: Formula: (< 2 v_is_prime__~n_9) InVars {is_prime__~n=v_is_prime__~n_9} OutVars{is_prime__~n=v_is_prime__~n_9} AuxVars[] AssignedVars[] 422#L63 [199] L63-->L66: Formula: (> v_is_prime__~m_1 1) InVars {is_prime__~m=v_is_prime__~m_1} OutVars{is_prime__~m=v_is_prime__~m_1} AuxVars[] AssignedVars[] 398#L66 [158] L66-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~mInParam_4| v_is_prime__~m_6) (= |v_multiple_of_#in~nInParam_4| v_is_prime__~n_10)) InVars {is_prime__~n=v_is_prime__~n_10, is_prime__~m=v_is_prime__~m_6} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_4|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_4|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 426#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 441#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 439#L33 [203] L33-->L36: Formula: (>= v_multiple_of_~n_5 0) InVars {multiple_of_~n=v_multiple_of_~n_5} OutVars{multiple_of_~n=v_multiple_of_~n_5} AuxVars[] AssignedVars[] 440#L36 [226] L36-->L39: Formula: (< 0 v_multiple_of_~m_7) InVars {multiple_of_~m=v_multiple_of_~m_7} OutVars{multiple_of_~m=v_multiple_of_~m_7} AuxVars[] AssignedVars[] 444#L39 [228] L39-->L42: Formula: (< 0 v_multiple_of_~n_7) InVars {multiple_of_~n=v_multiple_of_~n_7} OutVars{multiple_of_~n=v_multiple_of_~n_7} AuxVars[] AssignedVars[] 399#L42 [141] L42-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~nInParam_3| (+ v_multiple_of_~n_11 (* (- 1) v_multiple_of_~m_11))) (= |v_multiple_of_#in~mInParam_3| v_multiple_of_~m_11)) InVars {multiple_of_~m=v_multiple_of_~m_11, multiple_of_~n=v_multiple_of_~n_11} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_3|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_3|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 426#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 441#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 439#L33 [203] L33-->L36: Formula: (>= v_multiple_of_~n_5 0) InVars {multiple_of_~n=v_multiple_of_~n_5} OutVars{multiple_of_~n=v_multiple_of_~n_5} AuxVars[] AssignedVars[] 440#L36 [226] L36-->L39: Formula: (< 0 v_multiple_of_~m_7) InVars {multiple_of_~m=v_multiple_of_~m_7} OutVars{multiple_of_~m=v_multiple_of_~m_7} AuxVars[] AssignedVars[] 444#L39 [183] L39-->multiple_ofFINAL: Formula: (and (= 0 v_multiple_of_~n_6) (= |v_multiple_of_#res_4| 1)) InVars {multiple_of_~n=v_multiple_of_~n_6} OutVars{multiple_of_~n=v_multiple_of_~n_6, multiple_of_#res=|v_multiple_of_#res_4|} AuxVars[] AssignedVars[multiple_of_#res] 424#multiple_ofFINAL [150] multiple_ofFINAL-->multiple_ofEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 429#multiple_ofEXIT >[186] multiple_ofEXIT-->L42-1: AOR: Formula: (= |v_multiple_of_#t~ret4_4| |v_multiple_of_#resOutParam_3|) InVars {multiple_of_#res=|v_multiple_of_#resOutParam_3|} OutVars{multiple_of_#t~ret4=|v_multiple_of_#t~ret4_4|} AuxVars[] AssignedVars[multiple_of_#t~ret4] LVA: Formula: (and (= |v_multiple_of_#in~nInParam_3| (+ v_multiple_of_~n_11 (* (- 1) v_multiple_of_~m_11))) (= |v_multiple_of_#in~mInParam_3| v_multiple_of_~m_11)) InVars {multiple_of_~m=v_multiple_of_~m_11, multiple_of_~n=v_multiple_of_~n_11} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_3|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_3|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n] 430#L42-1 [135] L42-1-->multiple_ofFINAL: Formula: (= |v_multiple_of_#res_5| |v_multiple_of_#t~ret4_3|) InVars {multiple_of_#t~ret4=|v_multiple_of_#t~ret4_3|} OutVars{multiple_of_#t~ret4=|v_multiple_of_#t~ret4_2|, multiple_of_#res=|v_multiple_of_#res_5|} AuxVars[] AssignedVars[multiple_of_#t~ret4, multiple_of_#res] 446#multiple_ofFINAL [150] multiple_ofFINAL-->multiple_ofEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 445#multiple_ofEXIT >[191] multiple_ofEXIT-->L66-1: AOR: Formula: (= |v_is_prime__#t~ret6_6| |v_multiple_of_#resOutParam_4|) InVars {multiple_of_#res=|v_multiple_of_#resOutParam_4|} OutVars{is_prime__#t~ret6=|v_is_prime__#t~ret6_6|} AuxVars[] AssignedVars[is_prime__#t~ret6] LVA: Formula: (and (= |v_multiple_of_#in~mInParam_4| v_is_prime__~m_6) (= |v_multiple_of_#in~nInParam_4| v_is_prime__~n_10)) InVars {is_prime__~n=v_is_prime__~n_10, is_prime__~m=v_is_prime__~m_6} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_4|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_4|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n] 432#L66-1 [233] L66-1-->L69: Formula: (< 0 |v_is_prime__#t~ret6_5|) InVars {is_prime__#t~ret6=|v_is_prime__#t~ret6_5|} OutVars{is_prime__#t~ret6=|v_is_prime__#t~ret6_4|} AuxVars[] AssignedVars[is_prime__#t~ret6] 411#L69 [144] L69-->is_prime_ENTRY: Formula: (and (= |v_is_prime__#in~nInParam_2| v_is_prime__~n_11) (= |v_is_prime__#in~mInParam_2| (+ v_is_prime__~m_7 (- 1)))) InVars {is_prime__~n=v_is_prime__~n_11, is_prime__~m=v_is_prime__~m_7} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_2|, is_prime__#in~n=|v_is_prime__#in~nInParam_2|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n]< 419#is_prime_ENTRY [2020-06-21 23:44:14,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:44:14,624 INFO L82 PathProgramCache]: Analyzing trace with hash 8562, now seen corresponding path program 5 times [2020-06-21 23:44:14,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:44:14,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:44:14,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:14,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 23:44:14,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:14,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:44:14,635 INFO L82 PathProgramCache]: Analyzing trace with hash 564447467, now seen corresponding path program 1 times [2020-06-21 23:44:14,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:44:14,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:44:14,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:14,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-21 23:44:14,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:14,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:44:14,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1260132516, now seen corresponding path program 1 times [2020-06-21 23:44:14,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:44:14,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:44:14,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:14,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 23:44:14,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:44:14,749 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-21 23:44:14,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-21 23:44:14,749 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-21 23:44:14,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 23:44:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:44:14,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-21 23:44:14,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:44:14,839 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-21 23:44:14,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-21 23:44:14,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-06-21 23:44:15,137 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 23:44:15,138 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 23:44:15,139 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 23:44:15,139 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 23:44:15,139 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-21 23:44:15,139 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:15,139 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 23:44:15,139 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 23:44:15,140 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-06-21 23:44:15,140 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 23:44:15,140 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 23:44:15,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:15,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:15,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:15,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:15,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:15,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:15,233 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 23:44:15,233 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:15,241 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 23:44:15,241 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 23:44:15,250 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-21 23:44:15,250 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {is_prime__~n=0} Honda state: {is_prime__~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:15,280 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 23:44:15,280 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 23:44:15,285 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-21 23:44:15,285 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {is_prime__~m=0} Honda state: {is_prime__~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:15,328 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 23:44:15,328 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 23:44:15,332 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-21 23:44:15,333 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {is_prime__#t~ret6=0} Honda state: {is_prime__#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:15,363 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 23:44:15,363 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 23:44:15,367 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-21 23:44:15,367 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {is_prime__#t~ret7=0} Honda state: {is_prime__#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:15,399 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 23:44:15,399 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:15,443 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-21 23:44:15,443 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 23:44:15,486 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-21 23:44:15,489 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 23:44:15,489 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 23:44:15,489 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 23:44:15,489 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 23:44:15,489 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-21 23:44:15,489 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-21 23:44:15,489 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 23:44:15,489 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 23:44:15,489 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-06-21 23:44:15,490 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 23:44:15,490 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 23:44:15,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:15,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:15,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:15,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:15,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:15,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:15,554 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 23:44:15,560 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-21 23:44:15,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:44:15,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:44:15,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 23:44:15,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:44:15,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:44:15,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:44:15,566 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 23:44:15,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 23:44:15,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 23:44:15,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:44:15,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:44:15,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 23:44:15,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:44:15,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:44:15,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:44:15,570 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 23:44:15,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 23:44:15,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 23:44:15,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:44:15,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:44:15,572 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 23:44:15,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:44:15,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:44:15,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:44:15,573 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 23:44:15,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 23:44:15,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 23:44:15,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:44:15,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:44:15,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 23:44:15,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:44:15,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:44:15,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:44:15,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 23:44:15,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 23:44:15,583 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-21 23:44:15,592 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-06-21 23:44:15,593 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. [2020-06-21 23:44:15,595 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-21 23:44:15,595 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-21 23:44:15,595 INFO L518 LassoAnalysis]: Proved termination. [2020-06-21 23:44:15,596 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(is_prime__#in~m) = 1*is_prime__#in~m Supporting invariants [] [2020-06-21 23:44:15,597 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-21 23:44:15,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:44:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:44:15,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-21 23:44:15,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:44:15,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:44:15,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 18 conjunts are in the unsatisfiable core [2020-06-21 23:44:15,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:44:15,818 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-21 23:44:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:15,946 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-21 23:44:15,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:15,979 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-21 23:44:15,979 INFO L98 LoopCannibalizer]: 9 predicates before loop cannibalization 9 predicates after loop cannibalization [2020-06-21 23:44:15,982 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2020-06-21 23:44:15,983 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 53 states and 82 transitions. cyclomatic complexity: 32 Second operand 10 states. [2020-06-21 23:44:16,565 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 53 states and 82 transitions. cyclomatic complexity: 32. Second operand 10 states. Result 324 states and 509 transitions. Complement of second has 50 states. [2020-06-21 23:44:16,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2020-06-21 23:44:16,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-21 23:44:16,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 113 transitions. [2020-06-21 23:44:16,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 113 transitions. Stem has 2 letters. Loop has 24 letters. [2020-06-21 23:44:16,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 23:44:16,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 113 transitions. Stem has 26 letters. Loop has 24 letters. [2020-06-21 23:44:16,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 23:44:16,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 113 transitions. Stem has 2 letters. Loop has 48 letters. [2020-06-21 23:44:16,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 23:44:16,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 324 states and 509 transitions. [2020-06-21 23:44:16,594 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 40 [2020-06-21 23:44:16,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 324 states to 246 states and 374 transitions. [2020-06-21 23:44:16,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 143 [2020-06-21 23:44:16,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 145 [2020-06-21 23:44:16,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 246 states and 374 transitions. [2020-06-21 23:44:16,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-21 23:44:16,605 INFO L706 BuchiCegarLoop]: Abstraction has 246 states and 374 transitions. [2020-06-21 23:44:16,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states and 374 transitions. [2020-06-21 23:44:16,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 139. [2020-06-21 23:44:16,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-06-21 23:44:16,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 200 transitions. [2020-06-21 23:44:16,628 INFO L729 BuchiCegarLoop]: Abstraction has 139 states and 200 transitions. [2020-06-21 23:44:16,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-06-21 23:44:16,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-06-21 23:44:16,628 INFO L87 Difference]: Start difference. First operand 139 states and 200 transitions. Second operand 9 states. [2020-06-21 23:44:16,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-21 23:44:16,895 INFO L93 Difference]: Finished difference Result 225 states and 340 transitions. [2020-06-21 23:44:16,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-21 23:44:16,899 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 225 states and 340 transitions. [2020-06-21 23:44:16,905 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 31 [2020-06-21 23:44:16,912 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 225 states to 216 states and 328 transitions. [2020-06-21 23:44:16,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2020-06-21 23:44:16,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2020-06-21 23:44:16,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 216 states and 328 transitions. [2020-06-21 23:44:16,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-21 23:44:16,913 INFO L706 BuchiCegarLoop]: Abstraction has 216 states and 328 transitions. [2020-06-21 23:44:16,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states and 328 transitions. [2020-06-21 23:44:16,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 148. [2020-06-21 23:44:16,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-06-21 23:44:16,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 212 transitions. [2020-06-21 23:44:16,929 INFO L729 BuchiCegarLoop]: Abstraction has 148 states and 212 transitions. [2020-06-21 23:44:16,929 INFO L609 BuchiCegarLoop]: Abstraction has 148 states and 212 transitions. [2020-06-21 23:44:16,929 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-21 23:44:16,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 148 states and 212 transitions. [2020-06-21 23:44:16,931 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2020-06-21 23:44:16,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-21 23:44:16,931 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-21 23:44:16,932 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-21 23:44:16,932 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-21 23:44:16,932 INFO L794 eck$LassoCheckResult]: Stem: 1471#ULTIMATE.startENTRY [241] ULTIMATE.startENTRY-->L51: Formula: (and (= v_ULTIMATE.start_main_~n~0_7 |v_ULTIMATE.start_is_prime_#in~n_2|) (<= 1 v_ULTIMATE.start_main_~n~0_7) (<= v_ULTIMATE.start_main_~n~0_7 46340) (= v_ULTIMATE.start_is_prime_~n_5 |v_ULTIMATE.start_is_prime_#in~n_2|)) InVars {} OutVars{ULTIMATE.start_is_prime_#in~n=|v_ULTIMATE.start_is_prime_#in~n_2|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_5, ULTIMATE.start_is_prime_#res=|v_ULTIMATE.start_is_prime_#res_5|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_5, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_12, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_8|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_5|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_10|, ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_7, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_8|} AuxVars[] AssignedVars[ULTIMATE.start_is_prime_#in~n, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_is_prime_~n, ULTIMATE.start_is_prime_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~result~0, ULTIMATE.start_main_~f1~0, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_#t~short13, ULTIMATE.start_main_~f2~0, ULTIMATE.start_is_prime_#t~ret5] 1436#L51 [130] L51-->is_prime_ENTRY: Formula: (and (= |v_is_prime__#in~mInParam_1| (+ v_ULTIMATE.start_is_prime_~n_4 (- 1))) (= |v_is_prime__#in~nInParam_1| v_ULTIMATE.start_is_prime_~n_4)) InVars {ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_4} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_1|, is_prime__#in~n=|v_is_prime__#in~nInParam_1|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n]< 1437#is_prime_ENTRY [131] is_prime_ENTRY-->L56: Formula: (and (= v_is_prime__~n_4 |v_is_prime__#in~n_1|) (= v_is_prime__~m_4 |v_is_prime__#in~m_1|)) InVars {is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} OutVars{is_prime__~n=v_is_prime__~n_4, is_prime__~m=v_is_prime__~m_4, is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} AuxVars[] AssignedVars[is_prime__~n, is_prime__~m] 1439#L56 [196] L56-->L59: Formula: (> v_is_prime__~n_6 1) InVars {is_prime__~n=v_is_prime__~n_6} OutVars{is_prime__~n=v_is_prime__~n_6} AuxVars[] AssignedVars[] 1488#L59 [215] L59-->L62: Formula: (< 2 v_is_prime__~n_8) InVars {is_prime__~n=v_is_prime__~n_8} OutVars{is_prime__~n=v_is_prime__~n_8} AuxVars[] AssignedVars[] 1489#L62 [148] L62-->L63: Formula: (< 2 v_is_prime__~n_9) InVars {is_prime__~n=v_is_prime__~n_9} OutVars{is_prime__~n=v_is_prime__~n_9} AuxVars[] AssignedVars[] 1491#L63 [199] L63-->L66: Formula: (> v_is_prime__~m_1 1) InVars {is_prime__~m=v_is_prime__~m_1} OutVars{is_prime__~m=v_is_prime__~m_1} AuxVars[] AssignedVars[] 1416#L66 [158] L66-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~mInParam_4| v_is_prime__~m_6) (= |v_multiple_of_#in~nInParam_4| v_is_prime__~n_10)) InVars {is_prime__~n=v_is_prime__~n_10, is_prime__~m=v_is_prime__~m_6} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_4|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_4|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 1479#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 1520#L30 [156] L30-->L31: Formula: (< v_multiple_of_~m_2 0) InVars {multiple_of_~m=v_multiple_of_~m_2} OutVars{multiple_of_~m=v_multiple_of_~m_2} AuxVars[] AssignedVars[] 1451#L31 [2020-06-21 23:44:16,932 INFO L796 eck$LassoCheckResult]: Loop: 1451#L31 [138] L31-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~mInParam_1| (- v_multiple_of_~m_9)) (= |v_multiple_of_#in~nInParam_1| v_multiple_of_~n_9)) InVars {multiple_of_~m=v_multiple_of_~m_9, multiple_of_~n=v_multiple_of_~n_9} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_1|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_1|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 1456#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 1534#L30 [156] L30-->L31: Formula: (< v_multiple_of_~m_2 0) InVars {multiple_of_~m=v_multiple_of_~m_2} OutVars{multiple_of_~m=v_multiple_of_~m_2} AuxVars[] AssignedVars[] 1451#L31 [2020-06-21 23:44:16,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:44:16,933 INFO L82 PathProgramCache]: Analyzing trace with hash -122927766, now seen corresponding path program 1 times [2020-06-21 23:44:16,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:44:16,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:44:16,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:16,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 23:44:16,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:44:16,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-21 23:44:16,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-21 23:44:16,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-21 23:44:16,971 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-21 23:44:16,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:44:16,971 INFO L82 PathProgramCache]: Analyzing trace with hash 168300, now seen corresponding path program 1 times [2020-06-21 23:44:16,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:44:16,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:44:16,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:16,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 23:44:16,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:16,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:16,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:17,028 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 23:44:17,028 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 23:44:17,029 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 23:44:17,029 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 23:44:17,029 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-21 23:44:17,029 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:17,029 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 23:44:17,029 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 23:44:17,029 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop [2020-06-21 23:44:17,029 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 23:44:17,029 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 23:44:17,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:17,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:17,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:17,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:17,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:17,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:17,091 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 23:44:17,091 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:17,095 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 23:44:17,095 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 23:44:17,099 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-21 23:44:17,099 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#t~ret4=0} Honda state: {multiple_of_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:17,127 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 23:44:17,127 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 23:44:17,133 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-21 23:44:17,133 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_~n=4, multiple_of_#in~n=4} Honda state: {multiple_of_~n=4, multiple_of_#in~n=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:17,163 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 23:44:17,163 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 23:44:17,166 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-21 23:44:17,167 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#t~ret2=0} Honda state: {multiple_of_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:17,196 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 23:44:17,196 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 23:44:17,199 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-21 23:44:17,200 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#t~ret3=0} Honda state: {multiple_of_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:17,228 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 23:44:17,228 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:17,262 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-21 23:44:17,262 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 23:44:18,263 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-21 23:44:18,266 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 23:44:18,266 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 23:44:18,266 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 23:44:18,266 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 23:44:18,266 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-21 23:44:18,266 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-21 23:44:18,266 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 23:44:18,266 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 23:44:18,267 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop [2020-06-21 23:44:18,267 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 23:44:18,267 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 23:44:18,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:18,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:18,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:18,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:18,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:18,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:18,326 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 23:44:18,326 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-21 23:44:18,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:44:18,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:44:18,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 23:44:18,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:44:18,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:44:18,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:44:18,328 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 23:44:18,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 23:44:18,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 23:44:18,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:44:18,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:44:18,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 23:44:18,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:44:18,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:44:18,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:44:18,331 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 23:44:18,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 23:44:18,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 23:44:18,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:44:18,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:44:18,334 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 23:44:18,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:44:18,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:44:18,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:44:18,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 23:44:18,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 23:44:18,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 23:44:18,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:44:18,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:44:18,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 23:44:18,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:44:18,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:44:18,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:44:18,337 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 23:44:18,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 23:44:18,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 23:44:18,338 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:44:18,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:44:18,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 23:44:18,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:44:18,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:44:18,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:44:18,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 23:44:18,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 23:44:18,344 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-21 23:44:18,346 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-06-21 23:44:18,346 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-21 23:44:18,347 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-21 23:44:18,347 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-21 23:44:18,347 INFO L518 LassoAnalysis]: Proved termination. [2020-06-21 23:44:18,347 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_~m) = 1*multiple_of_~m Supporting invariants [] [2020-06-21 23:44:18,347 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-21 23:44:18,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:44:18,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:44:18,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-21 23:44:18,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:44:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:44:18,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-21 23:44:18,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:44:18,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-21 23:44:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:18,425 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-21 23:44:18,426 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-21 23:44:18,426 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-21 23:44:18,426 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 148 states and 212 transitions. cyclomatic complexity: 68 Second operand 4 states. [2020-06-21 23:44:18,569 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 148 states and 212 transitions. cyclomatic complexity: 68. Second operand 4 states. Result 392 states and 587 transitions. Complement of second has 53 states. [2020-06-21 23:44:18,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-06-21 23:44:18,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-21 23:44:18,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2020-06-21 23:44:18,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 75 transitions. Stem has 10 letters. Loop has 3 letters. [2020-06-21 23:44:18,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 23:44:18,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 75 transitions. Stem has 13 letters. Loop has 3 letters. [2020-06-21 23:44:18,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 23:44:18,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 75 transitions. Stem has 10 letters. Loop has 6 letters. [2020-06-21 23:44:18,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 23:44:18,576 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 392 states and 587 transitions. [2020-06-21 23:44:18,605 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 106 [2020-06-21 23:44:18,610 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 392 states to 240 states and 345 transitions. [2020-06-21 23:44:18,611 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2020-06-21 23:44:18,611 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2020-06-21 23:44:18,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 240 states and 345 transitions. [2020-06-21 23:44:18,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-21 23:44:18,612 INFO L706 BuchiCegarLoop]: Abstraction has 240 states and 345 transitions. [2020-06-21 23:44:18,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states and 345 transitions. [2020-06-21 23:44:18,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 163. [2020-06-21 23:44:18,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-06-21 23:44:18,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 235 transitions. [2020-06-21 23:44:18,623 INFO L729 BuchiCegarLoop]: Abstraction has 163 states and 235 transitions. [2020-06-21 23:44:18,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-21 23:44:18,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-21 23:44:18,623 INFO L87 Difference]: Start difference. First operand 163 states and 235 transitions. Second operand 5 states. [2020-06-21 23:44:18,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-21 23:44:18,702 INFO L93 Difference]: Finished difference Result 144 states and 200 transitions. [2020-06-21 23:44:18,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-21 23:44:18,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 200 transitions. [2020-06-21 23:44:18,708 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2020-06-21 23:44:18,710 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 144 states and 200 transitions. [2020-06-21 23:44:18,710 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2020-06-21 23:44:18,711 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2020-06-21 23:44:18,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 144 states and 200 transitions. [2020-06-21 23:44:18,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-21 23:44:18,711 INFO L706 BuchiCegarLoop]: Abstraction has 144 states and 200 transitions. [2020-06-21 23:44:18,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states and 200 transitions. [2020-06-21 23:44:18,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2020-06-21 23:44:18,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-06-21 23:44:18,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 195 transitions. [2020-06-21 23:44:18,720 INFO L729 BuchiCegarLoop]: Abstraction has 140 states and 195 transitions. [2020-06-21 23:44:18,720 INFO L609 BuchiCegarLoop]: Abstraction has 140 states and 195 transitions. [2020-06-21 23:44:18,720 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-21 23:44:18,720 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states and 195 transitions. [2020-06-21 23:44:18,722 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2020-06-21 23:44:18,722 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-21 23:44:18,722 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-21 23:44:18,722 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-21 23:44:18,722 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-21 23:44:18,723 INFO L794 eck$LassoCheckResult]: Stem: 2432#ULTIMATE.startENTRY [241] ULTIMATE.startENTRY-->L51: Formula: (and (= v_ULTIMATE.start_main_~n~0_7 |v_ULTIMATE.start_is_prime_#in~n_2|) (<= 1 v_ULTIMATE.start_main_~n~0_7) (<= v_ULTIMATE.start_main_~n~0_7 46340) (= v_ULTIMATE.start_is_prime_~n_5 |v_ULTIMATE.start_is_prime_#in~n_2|)) InVars {} OutVars{ULTIMATE.start_is_prime_#in~n=|v_ULTIMATE.start_is_prime_#in~n_2|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_5, ULTIMATE.start_is_prime_#res=|v_ULTIMATE.start_is_prime_#res_5|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_5, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_12, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_8|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_5|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_10|, ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_7, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_8|} AuxVars[] AssignedVars[ULTIMATE.start_is_prime_#in~n, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_is_prime_~n, ULTIMATE.start_is_prime_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~result~0, ULTIMATE.start_main_~f1~0, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_#t~short13, ULTIMATE.start_main_~f2~0, ULTIMATE.start_is_prime_#t~ret5] 2384#L51 [130] L51-->is_prime_ENTRY: Formula: (and (= |v_is_prime__#in~mInParam_1| (+ v_ULTIMATE.start_is_prime_~n_4 (- 1))) (= |v_is_prime__#in~nInParam_1| v_ULTIMATE.start_is_prime_~n_4)) InVars {ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_4} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_1|, is_prime__#in~n=|v_is_prime__#in~nInParam_1|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n]< 2400#is_prime_ENTRY [131] is_prime_ENTRY-->L56: Formula: (and (= v_is_prime__~n_4 |v_is_prime__#in~n_1|) (= v_is_prime__~m_4 |v_is_prime__#in~m_1|)) InVars {is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} OutVars{is_prime__~n=v_is_prime__~n_4, is_prime__~m=v_is_prime__~m_4, is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} AuxVars[] AssignedVars[is_prime__~n, is_prime__~m] 2402#L56 [173] L56-->is_prime_FINAL: Formula: (and (<= v_is_prime__~n_5 1) (= |v_is_prime__#res_3| 0)) InVars {is_prime__~n=v_is_prime__~n_5} OutVars{is_prime__~n=v_is_prime__~n_5, is_prime__#res=|v_is_prime__#res_3|} AuxVars[] AssignedVars[is_prime__#res] 2385#is_prime_FINAL [160] is_prime_FINAL-->is_prime_EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2442#is_prime_EXIT >[193] is_prime_EXIT-->L51-1: AOR: Formula: (= |v_ULTIMATE.start_is_prime_#t~ret5_5| |v_is_prime__#resOutParam_1|) InVars {is_prime__#res=|v_is_prime__#resOutParam_1|} OutVars{ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_5|} AuxVars[] AssignedVars[ULTIMATE.start_is_prime_#t~ret5] LVA: Formula: (and (= |v_is_prime__#in~mInParam_1| (+ v_ULTIMATE.start_is_prime_~n_4 (- 1))) (= |v_is_prime__#in~nInParam_1| v_ULTIMATE.start_is_prime_~n_4)) InVars {ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_4} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_1|, is_prime__#in~n=|v_is_prime__#in~nInParam_1|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n] 2392#L51-1 [242] L51-1-->L85: Formula: (and (<= 1 v_ULTIMATE.start_main_~f1~0_13) (= |v_ULTIMATE.start_main_#t~nondet10_8| v_ULTIMATE.start_main_~f1~0_13) (<= v_ULTIMATE.start_main_~f1~0_13 46340) (= v_ULTIMATE.start_main_~result~0_6 |v_ULTIMATE.start_is_prime_#res_6|) (= |v_ULTIMATE.start_is_prime_#t~ret5_10| |v_ULTIMATE.start_is_prime_#res_6|) (= |v_ULTIMATE.start_main_#t~nondet11_6| v_ULTIMATE.start_main_~f2~0_8)) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_8|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_6|, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_10|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_7|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_5|, ULTIMATE.start_is_prime_#res=|v_ULTIMATE.start_is_prime_#res_6|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_6|, ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_8, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_13, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_6, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_is_prime_#res, ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_~f2~0, ULTIMATE.start_main_~f1~0, ULTIMATE.start_main_~result~0, ULTIMATE.start_is_prime_#t~ret5] 2393#L85 [222] L85-->L89: Formula: (and (not |v_ULTIMATE.start_main_#t~short13_9|) (>= v_ULTIMATE.start_main_~f1~0_9 1) (>= 46340 v_ULTIMATE.start_main_~f1~0_9) (> v_ULTIMATE.start_main_~result~0_3 1)) InVars {ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_9, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_3} OutVars{ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_9|, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_9, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short13] 2406#L89 [177] L89-->L89-1: Formula: |v_ULTIMATE.start_main_#t~short13_1| InVars {ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_1|} OutVars{ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_1|} AuxVars[] AssignedVars[] 2376#L89-1 [176] L89-1-->multENTRY: Formula: (and (= |v_mult_#in~nInParam_3| v_ULTIMATE.start_main_~f1~0_10) (= |v_mult_#in~mInParam_3| v_ULTIMATE.start_main_~f2~0_6)) InVars {ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_6, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_10} OutVars{mult_#in~m=|v_mult_#in~mInParam_3|, mult_#in~n=|v_mult_#in~nInParam_3|} AuxVars[] AssignedVars[mult_#in~m, mult_#in~n]< 2391#multENTRY [2020-06-21 23:44:18,723 INFO L796 eck$LassoCheckResult]: Loop: 2391#multENTRY [180] multENTRY-->L16: Formula: (and (= v_mult_~n_2 |v_mult_#in~n_1|) (= v_mult_~m_6 |v_mult_#in~m_1|)) InVars {mult_#in~m=|v_mult_#in~m_1|, mult_#in~n=|v_mult_#in~n_1|} OutVars{mult_#in~m=|v_mult_#in~m_1|, mult_~n=v_mult_~n_2, mult_~m=v_mult_~m_6, mult_#in~n=|v_mult_#in~n_1|} AuxVars[] AssignedVars[mult_~n, mult_~m] 2374#L16 [125] L16-->L17: Formula: (< v_mult_~m_7 0) InVars {mult_~m=v_mult_~m_7} OutVars{mult_~m=v_mult_~m_7} AuxVars[] AssignedVars[] 2375#L17 [179] L17-->multENTRY: Formula: (and (= |v_mult_#in~nInParam_1| v_mult_~n_5) (= |v_mult_#in~mInParam_1| (- v_mult_~m_10))) InVars {mult_~n=v_mult_~n_5, mult_~m=v_mult_~m_10} OutVars{mult_#in~m=|v_mult_#in~mInParam_1|, mult_#in~n=|v_mult_#in~nInParam_1|} AuxVars[] AssignedVars[mult_#in~m, mult_#in~n]< 2391#multENTRY [2020-06-21 23:44:18,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:44:18,724 INFO L82 PathProgramCache]: Analyzing trace with hash -592378520, now seen corresponding path program 1 times [2020-06-21 23:44:18,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:44:18,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:44:18,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:18,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 23:44:18,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:44:18,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-21 23:44:18,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-21 23:44:18,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-21 23:44:18,741 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-21 23:44:18,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:44:18,741 INFO L82 PathProgramCache]: Analyzing trace with hash 206825, now seen corresponding path program 1 times [2020-06-21 23:44:18,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:44:18,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:44:18,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:18,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 23:44:18,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:18,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:18,786 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 23:44:18,787 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 23:44:18,787 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 23:44:18,787 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 23:44:18,787 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-21 23:44:18,787 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:18,787 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 23:44:18,787 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 23:44:18,787 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop [2020-06-21 23:44:18,788 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 23:44:18,788 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 23:44:18,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:18,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:18,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:18,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:18,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:18,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:18,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:18,845 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 23:44:18,846 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:18,853 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 23:44:18,853 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 23:44:18,857 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-21 23:44:18,857 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret1=0} Honda state: {mult_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:18,885 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 23:44:18,885 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 23:44:18,889 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-21 23:44:18,889 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~n=0} Honda state: {mult_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:18,916 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 23:44:18,917 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 23:44:18,920 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-21 23:44:18,920 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~m=0} Honda state: {mult_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-06-21 23:44:18,948 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 23:44:18,948 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:18,951 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-21 23:44:18,951 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#res=0} Honda state: {mult_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:18,986 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 23:44:18,986 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 23:44:18,989 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-21 23:44:18,990 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret0=0} Honda state: {mult_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:19,018 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 23:44:19,019 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 23:44:19,022 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-21 23:44:19,022 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#in~n=0} Honda state: {mult_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:19,051 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 23:44:19,051 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:19,083 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-21 23:44:19,083 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 23:44:19,119 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-21 23:44:19,121 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 23:44:19,121 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 23:44:19,121 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 23:44:19,121 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 23:44:19,122 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-21 23:44:19,122 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-21 23:44:19,122 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 23:44:19,122 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 23:44:19,122 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop [2020-06-21 23:44:19,122 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 23:44:19,122 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 23:44:19,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:19,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:19,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:19,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:19,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:19,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:19,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:19,168 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 23:44:19,168 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-21 23:44:19,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:44:19,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:44:19,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 23:44:19,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:44:19,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:44:19,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:44:19,170 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 23:44:19,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 23:44:19,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 23:44:19,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:44:19,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:44:19,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 23:44:19,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:44:19,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:44:19,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:44:19,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 23:44:19,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 23:44:19,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 23:44:19,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:44:19,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:44:19,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 23:44:19,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:44:19,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:44:19,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:44:19,175 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 23:44:19,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 23:44:19,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 23:44:19,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:44:19,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:44:19,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 23:44:19,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:44:19,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:44:19,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:44:19,177 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 23:44:19,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 23:44:19,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 23:44:19,178 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:44:19,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:44:19,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 23:44:19,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:44:19,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:44:19,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:44:19,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 23:44:19,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 23:44:19,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 23:44:19,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:44:19,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:44:19,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 23:44:19,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:44:19,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:44:19,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:44:19,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 23:44:19,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 23:44:19,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 23:44:19,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:44:19,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:44:19,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 23:44:19,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:44:19,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:44:19,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:44:19,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 23:44:19,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 23:44:19,187 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-21 23:44:19,189 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-06-21 23:44:19,189 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-21 23:44:19,189 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-21 23:44:19,189 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-21 23:44:19,190 INFO L518 LassoAnalysis]: Proved termination. [2020-06-21 23:44:19,190 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_#in~m) = -1*mult_#in~m Supporting invariants [] [2020-06-21 23:44:19,190 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-21 23:44:19,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:44:19,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:44:19,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-21 23:44:19,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:44:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:44:19,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-21 23:44:19,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:44:19,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-21 23:44:19,280 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-21 23:44:19,281 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2020-06-21 23:44:19,281 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 140 states and 195 transitions. cyclomatic complexity: 59 Second operand 7 states. [2020-06-21 23:44:19,384 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 140 states and 195 transitions. cyclomatic complexity: 59. Second operand 7 states. Result 186 states and 257 transitions. Complement of second has 18 states. [2020-06-21 23:44:19,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-21 23:44:19,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-21 23:44:19,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2020-06-21 23:44:19,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 72 transitions. Stem has 10 letters. Loop has 3 letters. [2020-06-21 23:44:19,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 23:44:19,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 72 transitions. Stem has 13 letters. Loop has 3 letters. [2020-06-21 23:44:19,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 23:44:19,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 72 transitions. Stem has 10 letters. Loop has 6 letters. [2020-06-21 23:44:19,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 23:44:19,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 257 transitions. [2020-06-21 23:44:19,391 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2020-06-21 23:44:19,394 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 158 states and 217 transitions. [2020-06-21 23:44:19,394 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 86 [2020-06-21 23:44:19,394 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2020-06-21 23:44:19,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 158 states and 217 transitions. [2020-06-21 23:44:19,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-21 23:44:19,395 INFO L706 BuchiCegarLoop]: Abstraction has 158 states and 217 transitions. [2020-06-21 23:44:19,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states and 217 transitions. [2020-06-21 23:44:19,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 147. [2020-06-21 23:44:19,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-06-21 23:44:19,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 203 transitions. [2020-06-21 23:44:19,403 INFO L729 BuchiCegarLoop]: Abstraction has 147 states and 203 transitions. [2020-06-21 23:44:19,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-21 23:44:19,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-21 23:44:19,403 INFO L87 Difference]: Start difference. First operand 147 states and 203 transitions. Second operand 3 states. [2020-06-21 23:44:19,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-21 23:44:19,438 INFO L93 Difference]: Finished difference Result 147 states and 203 transitions. [2020-06-21 23:44:19,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-06-21 23:44:19,441 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 203 transitions. [2020-06-21 23:44:19,443 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2020-06-21 23:44:19,445 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 147 states and 203 transitions. [2020-06-21 23:44:19,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2020-06-21 23:44:19,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2020-06-21 23:44:19,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 147 states and 203 transitions. [2020-06-21 23:44:19,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-21 23:44:19,446 INFO L706 BuchiCegarLoop]: Abstraction has 147 states and 203 transitions. [2020-06-21 23:44:19,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 203 transitions. [2020-06-21 23:44:19,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2020-06-21 23:44:19,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-06-21 23:44:19,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 203 transitions. [2020-06-21 23:44:19,459 INFO L729 BuchiCegarLoop]: Abstraction has 147 states and 203 transitions. [2020-06-21 23:44:19,459 INFO L609 BuchiCegarLoop]: Abstraction has 147 states and 203 transitions. [2020-06-21 23:44:19,459 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2020-06-21 23:44:19,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 147 states and 203 transitions. [2020-06-21 23:44:19,461 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2020-06-21 23:44:19,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-21 23:44:19,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-21 23:44:19,462 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-21 23:44:19,462 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-21 23:44:19,462 INFO L794 eck$LassoCheckResult]: Stem: 3137#ULTIMATE.startENTRY [241] ULTIMATE.startENTRY-->L51: Formula: (and (= v_ULTIMATE.start_main_~n~0_7 |v_ULTIMATE.start_is_prime_#in~n_2|) (<= 1 v_ULTIMATE.start_main_~n~0_7) (<= v_ULTIMATE.start_main_~n~0_7 46340) (= v_ULTIMATE.start_is_prime_~n_5 |v_ULTIMATE.start_is_prime_#in~n_2|)) InVars {} OutVars{ULTIMATE.start_is_prime_#in~n=|v_ULTIMATE.start_is_prime_#in~n_2|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_5, ULTIMATE.start_is_prime_#res=|v_ULTIMATE.start_is_prime_#res_5|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_5, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_12, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_8|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_5|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_10|, ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_7, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_8|} AuxVars[] AssignedVars[ULTIMATE.start_is_prime_#in~n, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_is_prime_~n, ULTIMATE.start_is_prime_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~result~0, ULTIMATE.start_main_~f1~0, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_#t~short13, ULTIMATE.start_main_~f2~0, ULTIMATE.start_is_prime_#t~ret5] 3092#L51 [130] L51-->is_prime_ENTRY: Formula: (and (= |v_is_prime__#in~mInParam_1| (+ v_ULTIMATE.start_is_prime_~n_4 (- 1))) (= |v_is_prime__#in~nInParam_1| v_ULTIMATE.start_is_prime_~n_4)) InVars {ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_4} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_1|, is_prime__#in~n=|v_is_prime__#in~nInParam_1|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n]< 3101#is_prime_ENTRY [131] is_prime_ENTRY-->L56: Formula: (and (= v_is_prime__~n_4 |v_is_prime__#in~n_1|) (= v_is_prime__~m_4 |v_is_prime__#in~m_1|)) InVars {is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} OutVars{is_prime__~n=v_is_prime__~n_4, is_prime__~m=v_is_prime__~m_4, is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} AuxVars[] AssignedVars[is_prime__~n, is_prime__~m] 3103#L56 [196] L56-->L59: Formula: (> v_is_prime__~n_6 1) InVars {is_prime__~n=v_is_prime__~n_6} OutVars{is_prime__~n=v_is_prime__~n_6} AuxVars[] AssignedVars[] 3150#L59 [215] L59-->L62: Formula: (< 2 v_is_prime__~n_8) InVars {is_prime__~n=v_is_prime__~n_8} OutVars{is_prime__~n=v_is_prime__~n_8} AuxVars[] AssignedVars[] 3134#L62 [148] L62-->L63: Formula: (< 2 v_is_prime__~n_9) InVars {is_prime__~n=v_is_prime__~n_9} OutVars{is_prime__~n=v_is_prime__~n_9} AuxVars[] AssignedVars[] 3135#L63 [199] L63-->L66: Formula: (> v_is_prime__~m_1 1) InVars {is_prime__~m=v_is_prime__~m_1} OutVars{is_prime__~m=v_is_prime__~m_1} AuxVars[] AssignedVars[] 3082#L66 [158] L66-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~mInParam_4| v_is_prime__~m_6) (= |v_multiple_of_#in~nInParam_4| v_is_prime__~n_10)) InVars {is_prime__~n=v_is_prime__~n_10, is_prime__~m=v_is_prime__~m_6} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_4|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_4|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 3144#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 3197#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 3196#L33 [142] L33-->L34: Formula: (< v_multiple_of_~n_3 0) InVars {multiple_of_~n=v_multiple_of_~n_3} OutVars{multiple_of_~n=v_multiple_of_~n_3} AuxVars[] AssignedVars[] 3066#L34 [127] L34-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~nInParam_2| (- v_multiple_of_~n_10)) (= |v_multiple_of_#in~mInParam_2| v_multiple_of_~m_10)) InVars {multiple_of_~m=v_multiple_of_~m_10, multiple_of_~n=v_multiple_of_~n_10} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_2|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_2|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 3084#multiple_ofENTRY [2020-06-21 23:44:19,462 INFO L796 eck$LassoCheckResult]: Loop: 3084#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 3142#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 3127#L33 [142] L33-->L34: Formula: (< v_multiple_of_~n_3 0) InVars {multiple_of_~n=v_multiple_of_~n_3} OutVars{multiple_of_~n=v_multiple_of_~n_3} AuxVars[] AssignedVars[] 3062#L34 [127] L34-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~nInParam_2| (- v_multiple_of_~n_10)) (= |v_multiple_of_#in~mInParam_2| v_multiple_of_~m_10)) InVars {multiple_of_~m=v_multiple_of_~m_10, multiple_of_~n=v_multiple_of_~n_10} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_2|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_2|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 3084#multiple_ofENTRY [2020-06-21 23:44:19,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:44:19,463 INFO L82 PathProgramCache]: Analyzing trace with hash 2125549897, now seen corresponding path program 1 times [2020-06-21 23:44:19,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:44:19,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:44:19,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:19,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 23:44:19,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:19,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:44:19,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-21 23:44:19,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-21 23:44:19,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-21 23:44:19,509 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-21 23:44:19,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:44:19,509 INFO L82 PathProgramCache]: Analyzing trace with hash 6633507, now seen corresponding path program 1 times [2020-06-21 23:44:19,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:44:19,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:44:19,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:19,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 23:44:19,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:19,561 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 23:44:19,561 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 23:44:19,561 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 23:44:19,562 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 23:44:19,562 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-21 23:44:19,562 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:19,562 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 23:44:19,562 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 23:44:19,562 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Loop [2020-06-21 23:44:19,562 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 23:44:19,562 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 23:44:19,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:19,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:19,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:19,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:19,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:19,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:19,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:19,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:19,631 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 23:44:19,631 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:19,635 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 23:44:19,635 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 23:44:19,638 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-21 23:44:19,638 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_~n=0} Honda state: {multiple_of_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:19,665 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 23:44:19,665 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 23:44:19,669 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-21 23:44:19,669 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#res=0} Honda state: {multiple_of_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:19,697 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 23:44:19,697 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 23:44:19,700 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-21 23:44:19,700 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_~m=0} Honda state: {multiple_of_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:19,728 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 23:44:19,728 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:19,758 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-21 23:44:19,758 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 23:44:19,793 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-21 23:44:19,795 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 23:44:19,795 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 23:44:19,795 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 23:44:19,795 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 23:44:19,795 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-21 23:44:19,795 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-21 23:44:19,795 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 23:44:19,796 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 23:44:19,796 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Loop [2020-06-21 23:44:19,796 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 23:44:19,796 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 23:44:19,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:19,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:19,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:19,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:19,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:19,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:19,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:19,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:19,852 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 23:44:19,852 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-21 23:44:19,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:44:19,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:44:19,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 23:44:19,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:44:19,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:44:19,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:44:19,854 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 23:44:19,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 23:44:19,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 23:44:19,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:44:19,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:44:19,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 23:44:19,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:44:19,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:44:19,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:44:19,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 23:44:19,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 23:44:19,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 23:44:19,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:44:19,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:44:19,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 23:44:19,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:44:19,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:44:19,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:44:19,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 23:44:19,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 23:44:19,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 23:44:19,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:44:19,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:44:19,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 23:44:19,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:44:19,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:44:19,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:44:19,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 23:44:19,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 23:44:19,863 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-21 23:44:19,864 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-06-21 23:44:19,864 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-21 23:44:19,865 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-21 23:44:19,865 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-21 23:44:19,865 INFO L518 LassoAnalysis]: Proved termination. [2020-06-21 23:44:19,865 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_#in~n) = -1*multiple_of_#in~n Supporting invariants [] [2020-06-21 23:44:19,865 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-21 23:44:19,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:44:19,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:44:19,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-21 23:44:19,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:44:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:44:19,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-21 23:44:19,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:44:19,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-21 23:44:19,937 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-21 23:44:19,937 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-21 23:44:19,938 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 147 states and 203 transitions. cyclomatic complexity: 61 Second operand 4 states. [2020-06-21 23:44:20,039 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 147 states and 203 transitions. cyclomatic complexity: 61. Second operand 4 states. Result 465 states and 598 transitions. Complement of second has 47 states. [2020-06-21 23:44:20,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-06-21 23:44:20,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-21 23:44:20,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2020-06-21 23:44:20,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 63 transitions. Stem has 12 letters. Loop has 4 letters. [2020-06-21 23:44:20,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 23:44:20,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 63 transitions. Stem has 16 letters. Loop has 4 letters. [2020-06-21 23:44:20,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 23:44:20,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 63 transitions. Stem has 12 letters. Loop has 8 letters. [2020-06-21 23:44:20,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 23:44:20,045 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 465 states and 598 transitions. [2020-06-21 23:44:20,050 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2020-06-21 23:44:20,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 465 states to 237 states and 364 transitions. [2020-06-21 23:44:20,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 110 [2020-06-21 23:44:20,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2020-06-21 23:44:20,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 237 states and 364 transitions. [2020-06-21 23:44:20,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-21 23:44:20,055 INFO L706 BuchiCegarLoop]: Abstraction has 237 states and 364 transitions. [2020-06-21 23:44:20,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states and 364 transitions. [2020-06-21 23:44:20,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 213. [2020-06-21 23:44:20,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-06-21 23:44:20,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 303 transitions. [2020-06-21 23:44:20,065 INFO L729 BuchiCegarLoop]: Abstraction has 213 states and 303 transitions. [2020-06-21 23:44:20,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-21 23:44:20,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-06-21 23:44:20,066 INFO L87 Difference]: Start difference. First operand 213 states and 303 transitions. Second operand 7 states. [2020-06-21 23:44:20,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-21 23:44:20,203 INFO L93 Difference]: Finished difference Result 226 states and 339 transitions. [2020-06-21 23:44:20,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-21 23:44:20,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 226 states and 339 transitions. [2020-06-21 23:44:20,209 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 [2020-06-21 23:44:20,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 226 states to 226 states and 339 transitions. [2020-06-21 23:44:20,212 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 108 [2020-06-21 23:44:20,212 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 108 [2020-06-21 23:44:20,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 226 states and 339 transitions. [2020-06-21 23:44:20,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-21 23:44:20,213 INFO L706 BuchiCegarLoop]: Abstraction has 226 states and 339 transitions. [2020-06-21 23:44:20,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states and 339 transitions. [2020-06-21 23:44:20,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 211. [2020-06-21 23:44:20,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-06-21 23:44:20,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 299 transitions. [2020-06-21 23:44:20,222 INFO L729 BuchiCegarLoop]: Abstraction has 211 states and 299 transitions. [2020-06-21 23:44:20,222 INFO L609 BuchiCegarLoop]: Abstraction has 211 states and 299 transitions. [2020-06-21 23:44:20,222 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2020-06-21 23:44:20,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 211 states and 299 transitions. [2020-06-21 23:44:20,224 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 [2020-06-21 23:44:20,224 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-21 23:44:20,224 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-21 23:44:20,224 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-21 23:44:20,224 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-21 23:44:20,225 INFO L794 eck$LassoCheckResult]: Stem: 4316#ULTIMATE.startENTRY [241] ULTIMATE.startENTRY-->L51: Formula: (and (= v_ULTIMATE.start_main_~n~0_7 |v_ULTIMATE.start_is_prime_#in~n_2|) (<= 1 v_ULTIMATE.start_main_~n~0_7) (<= v_ULTIMATE.start_main_~n~0_7 46340) (= v_ULTIMATE.start_is_prime_~n_5 |v_ULTIMATE.start_is_prime_#in~n_2|)) InVars {} OutVars{ULTIMATE.start_is_prime_#in~n=|v_ULTIMATE.start_is_prime_#in~n_2|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_5, ULTIMATE.start_is_prime_#res=|v_ULTIMATE.start_is_prime_#res_5|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_5, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_12, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_8|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_5|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_10|, ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_7, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_8|} AuxVars[] AssignedVars[ULTIMATE.start_is_prime_#in~n, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_is_prime_~n, ULTIMATE.start_is_prime_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~result~0, ULTIMATE.start_main_~f1~0, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_#t~short13, ULTIMATE.start_main_~f2~0, ULTIMATE.start_is_prime_#t~ret5] 4275#L51 [130] L51-->is_prime_ENTRY: Formula: (and (= |v_is_prime__#in~mInParam_1| (+ v_ULTIMATE.start_is_prime_~n_4 (- 1))) (= |v_is_prime__#in~nInParam_1| v_ULTIMATE.start_is_prime_~n_4)) InVars {ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_4} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_1|, is_prime__#in~n=|v_is_prime__#in~nInParam_1|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n]< 4276#is_prime_ENTRY [131] is_prime_ENTRY-->L56: Formula: (and (= v_is_prime__~n_4 |v_is_prime__#in~n_1|) (= v_is_prime__~m_4 |v_is_prime__#in~m_1|)) InVars {is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} OutVars{is_prime__~n=v_is_prime__~n_4, is_prime__~m=v_is_prime__~m_4, is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} AuxVars[] AssignedVars[is_prime__~n, is_prime__~m] 4278#L56 [173] L56-->is_prime_FINAL: Formula: (and (<= v_is_prime__~n_5 1) (= |v_is_prime__#res_3| 0)) InVars {is_prime__~n=v_is_prime__~n_5} OutVars{is_prime__~n=v_is_prime__~n_5, is_prime__#res=|v_is_prime__#res_3|} AuxVars[] AssignedVars[is_prime__#res] 4328#is_prime_FINAL [160] is_prime_FINAL-->is_prime_EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 4329#is_prime_EXIT >[193] is_prime_EXIT-->L51-1: AOR: Formula: (= |v_ULTIMATE.start_is_prime_#t~ret5_5| |v_is_prime__#resOutParam_1|) InVars {is_prime__#res=|v_is_prime__#resOutParam_1|} OutVars{ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_5|} AuxVars[] AssignedVars[ULTIMATE.start_is_prime_#t~ret5] LVA: Formula: (and (= |v_is_prime__#in~mInParam_1| (+ v_ULTIMATE.start_is_prime_~n_4 (- 1))) (= |v_is_prime__#in~nInParam_1| v_ULTIMATE.start_is_prime_~n_4)) InVars {ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_4} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_1|, is_prime__#in~n=|v_is_prime__#in~nInParam_1|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n] 4269#L51-1 [242] L51-1-->L85: Formula: (and (<= 1 v_ULTIMATE.start_main_~f1~0_13) (= |v_ULTIMATE.start_main_#t~nondet10_8| v_ULTIMATE.start_main_~f1~0_13) (<= v_ULTIMATE.start_main_~f1~0_13 46340) (= v_ULTIMATE.start_main_~result~0_6 |v_ULTIMATE.start_is_prime_#res_6|) (= |v_ULTIMATE.start_is_prime_#t~ret5_10| |v_ULTIMATE.start_is_prime_#res_6|) (= |v_ULTIMATE.start_main_#t~nondet11_6| v_ULTIMATE.start_main_~f2~0_8)) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_8|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_6|, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_10|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_7|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_5|, ULTIMATE.start_is_prime_#res=|v_ULTIMATE.start_is_prime_#res_6|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_6|, ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_8, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_13, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_6, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_is_prime_#res, ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_~f2~0, ULTIMATE.start_main_~f1~0, ULTIMATE.start_main_~result~0, ULTIMATE.start_is_prime_#t~ret5] 4270#L85 [220] L85-->L89: Formula: (and |v_ULTIMATE.start_main_#t~short13_9| (>= v_ULTIMATE.start_main_~f1~0_9 1) (= v_ULTIMATE.start_main_~result~0_3 1) (>= 46340 v_ULTIMATE.start_main_~f1~0_9)) InVars {ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_9, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_3} OutVars{ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_9|, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_9, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short13] 4282#L89 [177] L89-->L89-1: Formula: |v_ULTIMATE.start_main_#t~short13_1| InVars {ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_1|} OutVars{ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_1|} AuxVars[] AssignedVars[] 4250#L89-1 [176] L89-1-->multENTRY: Formula: (and (= |v_mult_#in~nInParam_3| v_ULTIMATE.start_main_~f1~0_10) (= |v_mult_#in~mInParam_3| v_ULTIMATE.start_main_~f2~0_6)) InVars {ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_6, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_10} OutVars{mult_#in~m=|v_mult_#in~mInParam_3|, mult_#in~n=|v_mult_#in~nInParam_3|} AuxVars[] AssignedVars[mult_#in~m, mult_#in~n]< 4295#multENTRY [180] multENTRY-->L16: Formula: (and (= v_mult_~n_2 |v_mult_#in~n_1|) (= v_mult_~m_6 |v_mult_#in~m_1|)) InVars {mult_#in~m=|v_mult_#in~m_1|, mult_#in~n=|v_mult_#in~n_1|} OutVars{mult_#in~m=|v_mult_#in~m_1|, mult_~n=v_mult_~n_2, mult_~m=v_mult_~m_6, mult_#in~n=|v_mult_#in~n_1|} AuxVars[] AssignedVars[mult_~n, mult_~m] 4249#L16 [207] L16-->L19: Formula: (>= v_mult_~m_9 0) InVars {mult_~m=v_mult_~m_9} OutVars{mult_~m=v_mult_~m_9} AuxVars[] AssignedVars[] 4252#L19 [230] L19-->L22: Formula: (< 0 v_mult_~m_2) InVars {mult_~m=v_mult_~m_2} OutVars{mult_~m=v_mult_~m_2} AuxVars[] AssignedVars[] 4293#L22 [2020-06-21 23:44:20,225 INFO L796 eck$LassoCheckResult]: Loop: 4293#L22 [234] L22-->L25: Formula: (> 1 v_mult_~m_4) InVars {mult_~m=v_mult_~m_4} OutVars{mult_~m=v_mult_~m_4} AuxVars[] AssignedVars[] 4266#L25 [163] L25-->multENTRY: Formula: (and (= |v_mult_#in~mInParam_2| (+ v_mult_~m_11 (- 1))) (= |v_mult_#in~nInParam_2| v_mult_~n_6)) InVars {mult_~n=v_mult_~n_6, mult_~m=v_mult_~m_11} OutVars{mult_#in~m=|v_mult_#in~mInParam_2|, mult_#in~n=|v_mult_#in~nInParam_2|} AuxVars[] AssignedVars[mult_#in~m, mult_#in~n]< 4268#multENTRY [180] multENTRY-->L16: Formula: (and (= v_mult_~n_2 |v_mult_#in~n_1|) (= v_mult_~m_6 |v_mult_#in~m_1|)) InVars {mult_#in~m=|v_mult_#in~m_1|, mult_#in~n=|v_mult_#in~n_1|} OutVars{mult_#in~m=|v_mult_#in~m_1|, mult_~n=v_mult_~n_2, mult_~m=v_mult_~m_6, mult_#in~n=|v_mult_#in~n_1|} AuxVars[] AssignedVars[mult_~n, mult_~m] 4303#L16 [207] L16-->L19: Formula: (>= v_mult_~m_9 0) InVars {mult_~m=v_mult_~m_9} OutVars{mult_~m=v_mult_~m_9} AuxVars[] AssignedVars[] 4374#L19 [230] L19-->L22: Formula: (< 0 v_mult_~m_2) InVars {mult_~m=v_mult_~m_2} OutVars{mult_~m=v_mult_~m_2} AuxVars[] AssignedVars[] 4293#L22 [2020-06-21 23:44:20,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:44:20,225 INFO L82 PathProgramCache]: Analyzing trace with hash 415051269, now seen corresponding path program 1 times [2020-06-21 23:44:20,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:44:20,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:44:20,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:20,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 23:44:20,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:44:20,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-21 23:44:20,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-21 23:44:20,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-21 23:44:20,266 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-21 23:44:20,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:44:20,266 INFO L82 PathProgramCache]: Analyzing trace with hash 249768625, now seen corresponding path program 1 times [2020-06-21 23:44:20,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:44:20,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:44:20,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:20,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 23:44:20,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:20,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:44:20,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-21 23:44:20,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-21 23:44:20,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-21 23:44:20,292 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-21 23:44:20,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-21 23:44:20,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-06-21 23:44:20,293 INFO L87 Difference]: Start difference. First operand 211 states and 299 transitions. cyclomatic complexity: 93 Second operand 5 states. [2020-06-21 23:44:20,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-21 23:44:20,362 INFO L93 Difference]: Finished difference Result 217 states and 305 transitions. [2020-06-21 23:44:20,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-21 23:44:20,365 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 217 states and 305 transitions. [2020-06-21 23:44:20,368 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2020-06-21 23:44:20,370 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 217 states to 217 states and 305 transitions. [2020-06-21 23:44:20,371 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 105 [2020-06-21 23:44:20,371 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2020-06-21 23:44:20,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 217 states and 305 transitions. [2020-06-21 23:44:20,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-21 23:44:20,371 INFO L706 BuchiCegarLoop]: Abstraction has 217 states and 305 transitions. [2020-06-21 23:44:20,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states and 305 transitions. [2020-06-21 23:44:20,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 213. [2020-06-21 23:44:20,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-06-21 23:44:20,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 300 transitions. [2020-06-21 23:44:20,380 INFO L729 BuchiCegarLoop]: Abstraction has 213 states and 300 transitions. [2020-06-21 23:44:20,380 INFO L609 BuchiCegarLoop]: Abstraction has 213 states and 300 transitions. [2020-06-21 23:44:20,380 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2020-06-21 23:44:20,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 213 states and 300 transitions. [2020-06-21 23:44:20,382 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 50 [2020-06-21 23:44:20,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-21 23:44:20,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-21 23:44:20,382 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-21 23:44:20,382 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-21 23:44:20,383 INFO L794 eck$LassoCheckResult]: Stem: 4754#ULTIMATE.startENTRY [241] ULTIMATE.startENTRY-->L51: Formula: (and (= v_ULTIMATE.start_main_~n~0_7 |v_ULTIMATE.start_is_prime_#in~n_2|) (<= 1 v_ULTIMATE.start_main_~n~0_7) (<= v_ULTIMATE.start_main_~n~0_7 46340) (= v_ULTIMATE.start_is_prime_~n_5 |v_ULTIMATE.start_is_prime_#in~n_2|)) InVars {} OutVars{ULTIMATE.start_is_prime_#in~n=|v_ULTIMATE.start_is_prime_#in~n_2|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_5, ULTIMATE.start_is_prime_#res=|v_ULTIMATE.start_is_prime_#res_5|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_5, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_12, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_8|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_5|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_10|, ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_7, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_8|} AuxVars[] AssignedVars[ULTIMATE.start_is_prime_#in~n, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_is_prime_~n, ULTIMATE.start_is_prime_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~result~0, ULTIMATE.start_main_~f1~0, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_#t~short13, ULTIMATE.start_main_~f2~0, ULTIMATE.start_is_prime_#t~ret5] 4712#L51 [130] L51-->is_prime_ENTRY: Formula: (and (= |v_is_prime__#in~mInParam_1| (+ v_ULTIMATE.start_is_prime_~n_4 (- 1))) (= |v_is_prime__#in~nInParam_1| v_ULTIMATE.start_is_prime_~n_4)) InVars {ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_4} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_1|, is_prime__#in~n=|v_is_prime__#in~nInParam_1|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n]< 4713#is_prime_ENTRY [131] is_prime_ENTRY-->L56: Formula: (and (= v_is_prime__~n_4 |v_is_prime__#in~n_1|) (= v_is_prime__~m_4 |v_is_prime__#in~m_1|)) InVars {is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} OutVars{is_prime__~n=v_is_prime__~n_4, is_prime__~m=v_is_prime__~m_4, is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} AuxVars[] AssignedVars[is_prime__~n, is_prime__~m] 4715#L56 [173] L56-->is_prime_FINAL: Formula: (and (<= v_is_prime__~n_5 1) (= |v_is_prime__#res_3| 0)) InVars {is_prime__~n=v_is_prime__~n_5} OutVars{is_prime__~n=v_is_prime__~n_5, is_prime__#res=|v_is_prime__#res_3|} AuxVars[] AssignedVars[is_prime__#res] 4767#is_prime_FINAL [160] is_prime_FINAL-->is_prime_EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 4766#is_prime_EXIT >[193] is_prime_EXIT-->L51-1: AOR: Formula: (= |v_ULTIMATE.start_is_prime_#t~ret5_5| |v_is_prime__#resOutParam_1|) InVars {is_prime__#res=|v_is_prime__#resOutParam_1|} OutVars{ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_5|} AuxVars[] AssignedVars[ULTIMATE.start_is_prime_#t~ret5] LVA: Formula: (and (= |v_is_prime__#in~mInParam_1| (+ v_ULTIMATE.start_is_prime_~n_4 (- 1))) (= |v_is_prime__#in~nInParam_1| v_ULTIMATE.start_is_prime_~n_4)) InVars {ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_4} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_1|, is_prime__#in~n=|v_is_prime__#in~nInParam_1|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n] 4705#L51-1 [242] L51-1-->L85: Formula: (and (<= 1 v_ULTIMATE.start_main_~f1~0_13) (= |v_ULTIMATE.start_main_#t~nondet10_8| v_ULTIMATE.start_main_~f1~0_13) (<= v_ULTIMATE.start_main_~f1~0_13 46340) (= v_ULTIMATE.start_main_~result~0_6 |v_ULTIMATE.start_is_prime_#res_6|) (= |v_ULTIMATE.start_is_prime_#t~ret5_10| |v_ULTIMATE.start_is_prime_#res_6|) (= |v_ULTIMATE.start_main_#t~nondet11_6| v_ULTIMATE.start_main_~f2~0_8)) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_8|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_6|, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_10|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_7|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_5|, ULTIMATE.start_is_prime_#res=|v_ULTIMATE.start_is_prime_#res_6|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_6|, ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_8, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_13, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_6, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_is_prime_#res, ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_~f2~0, ULTIMATE.start_main_~f1~0, ULTIMATE.start_main_~result~0, ULTIMATE.start_is_prime_#t~ret5] 4706#L85 [220] L85-->L89: Formula: (and |v_ULTIMATE.start_main_#t~short13_9| (>= v_ULTIMATE.start_main_~f1~0_9 1) (= v_ULTIMATE.start_main_~result~0_3 1) (>= 46340 v_ULTIMATE.start_main_~f1~0_9)) InVars {ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_9, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_3} OutVars{ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_9|, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_9, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short13] 4719#L89 [177] L89-->L89-1: Formula: |v_ULTIMATE.start_main_#t~short13_1| InVars {ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_1|} OutVars{ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_1|} AuxVars[] AssignedVars[] 4686#L89-1 [176] L89-1-->multENTRY: Formula: (and (= |v_mult_#in~nInParam_3| v_ULTIMATE.start_main_~f1~0_10) (= |v_mult_#in~mInParam_3| v_ULTIMATE.start_main_~f2~0_6)) InVars {ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_6, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_10} OutVars{mult_#in~m=|v_mult_#in~mInParam_3|, mult_#in~n=|v_mult_#in~nInParam_3|} AuxVars[] AssignedVars[mult_#in~m, mult_#in~n]< 4738#multENTRY [180] multENTRY-->L16: Formula: (and (= v_mult_~n_2 |v_mult_#in~n_1|) (= v_mult_~m_6 |v_mult_#in~m_1|)) InVars {mult_#in~m=|v_mult_#in~m_1|, mult_#in~n=|v_mult_#in~n_1|} OutVars{mult_#in~m=|v_mult_#in~m_1|, mult_~n=v_mult_~n_2, mult_~m=v_mult_~m_6, mult_#in~n=|v_mult_#in~n_1|} AuxVars[] AssignedVars[mult_~n, mult_~m] 4685#L16 [207] L16-->L19: Formula: (>= v_mult_~m_9 0) InVars {mult_~m=v_mult_~m_9} OutVars{mult_~m=v_mult_~m_9} AuxVars[] AssignedVars[] 4688#L19 [2020-06-21 23:44:20,383 INFO L796 eck$LassoCheckResult]: Loop: 4688#L19 [230] L19-->L22: Formula: (< 0 v_mult_~m_2) InVars {mult_~m=v_mult_~m_2} OutVars{mult_~m=v_mult_~m_2} AuxVars[] AssignedVars[] 4736#L22 [235] L22-->L25: Formula: (< 1 v_mult_~m_4) InVars {mult_~m=v_mult_~m_4} OutVars{mult_~m=v_mult_~m_4} AuxVars[] AssignedVars[] 4702#L25 [163] L25-->multENTRY: Formula: (and (= |v_mult_#in~mInParam_2| (+ v_mult_~m_11 (- 1))) (= |v_mult_#in~nInParam_2| v_mult_~n_6)) InVars {mult_~n=v_mult_~n_6, mult_~m=v_mult_~m_11} OutVars{mult_#in~m=|v_mult_#in~mInParam_2|, mult_#in~n=|v_mult_#in~nInParam_2|} AuxVars[] AssignedVars[mult_#in~m, mult_#in~n]< 4704#multENTRY [180] multENTRY-->L16: Formula: (and (= v_mult_~n_2 |v_mult_#in~n_1|) (= v_mult_~m_6 |v_mult_#in~m_1|)) InVars {mult_#in~m=|v_mult_#in~m_1|, mult_#in~n=|v_mult_#in~n_1|} OutVars{mult_#in~m=|v_mult_#in~m_1|, mult_~n=v_mult_~n_2, mult_~m=v_mult_~m_6, mult_#in~n=|v_mult_#in~n_1|} AuxVars[] AssignedVars[mult_~n, mult_~m] 4747#L16 [207] L16-->L19: Formula: (>= v_mult_~m_9 0) InVars {mult_~m=v_mult_~m_9} OutVars{mult_~m=v_mult_~m_9} AuxVars[] AssignedVars[] 4688#L19 [2020-06-21 23:44:20,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:44:20,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1953051393, now seen corresponding path program 1 times [2020-06-21 23:44:20,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:44:20,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:44:20,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:20,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 23:44:20,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:44:20,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-21 23:44:20,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-21 23:44:20,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-21 23:44:20,411 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-21 23:44:20,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:44:20,411 INFO L82 PathProgramCache]: Analyzing trace with hash 248202296, now seen corresponding path program 1 times [2020-06-21 23:44:20,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:44:20,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:44:20,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:20,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 23:44:20,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:20,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:20,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:20,479 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 23:44:20,479 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 23:44:20,479 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 23:44:20,479 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 23:44:20,479 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-21 23:44:20,479 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:20,480 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 23:44:20,480 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 23:44:20,480 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration10_Loop [2020-06-21 23:44:20,480 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 23:44:20,480 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 23:44:20,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:20,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:20,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:20,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:20,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:20,553 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 23:44:20,553 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:20,558 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 23:44:20,558 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 23:44:20,562 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-21 23:44:20,562 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret0=0} Honda state: {mult_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:20,588 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 23:44:20,589 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 23:44:20,592 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-21 23:44:20,592 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret1=0} Honda state: {mult_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:20,620 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 23:44:20,620 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:20,652 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-21 23:44:20,653 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 23:44:21,822 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-21 23:44:21,824 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 23:44:21,824 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 23:44:21,825 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 23:44:21,825 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 23:44:21,825 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-21 23:44:21,825 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-21 23:44:21,825 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 23:44:21,825 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 23:44:21,825 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration10_Loop [2020-06-21 23:44:21,825 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 23:44:21,825 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 23:44:21,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:21,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:21,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:21,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:21,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:21,876 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 23:44:21,876 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-21 23:44:21,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:44:21,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:44:21,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 23:44:21,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:44:21,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:44:21,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:44:21,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 23:44:21,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 23:44:21,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 23:44:21,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:44:21,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:44:21,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 23:44:21,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:44:21,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:44:21,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:44:21,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 23:44:21,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 23:44:21,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 23:44:21,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:44:21,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:44:21,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 23:44:21,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:44:21,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:44:21,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:44:21,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 23:44:21,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 23:44:21,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 23:44:21,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:44:21,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:44:21,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 23:44:21,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:44:21,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:44:21,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:44:21,886 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 23:44:21,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 23:44:21,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 23:44:21,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:44:21,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:44:21,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 23:44:21,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:44:21,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:44:21,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:44:21,888 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 23:44:21,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 23:44:21,891 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-21 23:44:21,892 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-21 23:44:21,892 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-21 23:44:21,893 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-21 23:44:21,893 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-21 23:44:21,893 INFO L518 LassoAnalysis]: Proved termination. [2020-06-21 23:44:21,893 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_~m) = 1*mult_~m Supporting invariants [] [2020-06-21 23:44:21,894 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-21 23:44:21,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:44:21,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:44:21,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-21 23:44:21,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:44:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:44:21,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-21 23:44:21,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:44:21,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-21 23:44:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:44:22,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-21 23:44:22,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:44:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:22,108 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-21 23:44:22,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:44:22,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-21 23:44:22,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:44:22,183 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 7 predicates after loop cannibalization [2020-06-21 23:44:22,183 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 7 loop predicates [2020-06-21 23:44:22,183 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 213 states and 300 transitions. cyclomatic complexity: 92 Second operand 6 states. [2020-06-21 23:44:22,339 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 213 states and 300 transitions. cyclomatic complexity: 92. Second operand 6 states. Result 330 states and 450 transitions. Complement of second has 80 states. [2020-06-21 23:44:22,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 4 non-accepting loop states 2 accepting loop states [2020-06-21 23:44:22,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-21 23:44:22,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2020-06-21 23:44:22,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 12 letters. Loop has 5 letters. [2020-06-21 23:44:22,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 23:44:22,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 17 letters. Loop has 5 letters. [2020-06-21 23:44:22,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 23:44:22,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 12 letters. Loop has 10 letters. [2020-06-21 23:44:22,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 23:44:22,344 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 330 states and 450 transitions. [2020-06-21 23:44:22,348 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2020-06-21 23:44:22,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 330 states to 227 states and 314 transitions. [2020-06-21 23:44:22,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2020-06-21 23:44:22,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 99 [2020-06-21 23:44:22,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 227 states and 314 transitions. [2020-06-21 23:44:22,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-21 23:44:22,352 INFO L706 BuchiCegarLoop]: Abstraction has 227 states and 314 transitions. [2020-06-21 23:44:22,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states and 314 transitions. [2020-06-21 23:44:22,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 212. [2020-06-21 23:44:22,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-06-21 23:44:22,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 298 transitions. [2020-06-21 23:44:22,359 INFO L729 BuchiCegarLoop]: Abstraction has 212 states and 298 transitions. [2020-06-21 23:44:22,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-21 23:44:22,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-21 23:44:22,360 INFO L87 Difference]: Start difference. First operand 212 states and 298 transitions. Second operand 5 states. [2020-06-21 23:44:22,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-21 23:44:22,424 INFO L93 Difference]: Finished difference Result 218 states and 304 transitions. [2020-06-21 23:44:22,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-21 23:44:22,427 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 218 states and 304 transitions. [2020-06-21 23:44:22,429 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2020-06-21 23:44:22,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 218 states to 213 states and 298 transitions. [2020-06-21 23:44:22,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 96 [2020-06-21 23:44:22,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 96 [2020-06-21 23:44:22,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 213 states and 298 transitions. [2020-06-21 23:44:22,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-21 23:44:22,433 INFO L706 BuchiCegarLoop]: Abstraction has 213 states and 298 transitions. [2020-06-21 23:44:22,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states and 298 transitions. [2020-06-21 23:44:22,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2020-06-21 23:44:22,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-06-21 23:44:22,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 295 transitions. [2020-06-21 23:44:22,440 INFO L729 BuchiCegarLoop]: Abstraction has 211 states and 295 transitions. [2020-06-21 23:44:22,440 INFO L609 BuchiCegarLoop]: Abstraction has 211 states and 295 transitions. [2020-06-21 23:44:22,440 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2020-06-21 23:44:22,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 211 states and 295 transitions. [2020-06-21 23:44:22,442 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2020-06-21 23:44:22,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-21 23:44:22,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-21 23:44:22,443 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-21 23:44:22,443 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2020-06-21 23:44:22,443 INFO L794 eck$LassoCheckResult]: Stem: 5926#ULTIMATE.startENTRY [241] ULTIMATE.startENTRY-->L51: Formula: (and (= v_ULTIMATE.start_main_~n~0_7 |v_ULTIMATE.start_is_prime_#in~n_2|) (<= 1 v_ULTIMATE.start_main_~n~0_7) (<= v_ULTIMATE.start_main_~n~0_7 46340) (= v_ULTIMATE.start_is_prime_~n_5 |v_ULTIMATE.start_is_prime_#in~n_2|)) InVars {} OutVars{ULTIMATE.start_is_prime_#in~n=|v_ULTIMATE.start_is_prime_#in~n_2|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_5, ULTIMATE.start_is_prime_#res=|v_ULTIMATE.start_is_prime_#res_5|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_5, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_12, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_8|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_5|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_10|, ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_7, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_8|} AuxVars[] AssignedVars[ULTIMATE.start_is_prime_#in~n, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_is_prime_~n, ULTIMATE.start_is_prime_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~result~0, ULTIMATE.start_main_~f1~0, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_#t~short13, ULTIMATE.start_main_~f2~0, ULTIMATE.start_is_prime_#t~ret5] 5879#L51 [130] L51-->is_prime_ENTRY: Formula: (and (= |v_is_prime__#in~mInParam_1| (+ v_ULTIMATE.start_is_prime_~n_4 (- 1))) (= |v_is_prime__#in~nInParam_1| v_ULTIMATE.start_is_prime_~n_4)) InVars {ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_4} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_1|, is_prime__#in~n=|v_is_prime__#in~nInParam_1|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n]< 5880#is_prime_ENTRY [131] is_prime_ENTRY-->L56: Formula: (and (= v_is_prime__~n_4 |v_is_prime__#in~n_1|) (= v_is_prime__~m_4 |v_is_prime__#in~m_1|)) InVars {is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} OutVars{is_prime__~n=v_is_prime__~n_4, is_prime__~m=v_is_prime__~m_4, is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} AuxVars[] AssignedVars[is_prime__~n, is_prime__~m] 5882#L56 [196] L56-->L59: Formula: (> v_is_prime__~n_6 1) InVars {is_prime__~n=v_is_prime__~n_6} OutVars{is_prime__~n=v_is_prime__~n_6} AuxVars[] AssignedVars[] 5942#L59 [161] L59-->is_prime_FINAL: Formula: (and (= |v_is_prime__#res_4| 1) (= 2 v_is_prime__~n_7)) InVars {is_prime__~n=v_is_prime__~n_7} OutVars{is_prime__~n=v_is_prime__~n_7, is_prime__#res=|v_is_prime__#res_4|} AuxVars[] AssignedVars[is_prime__#res] 5941#is_prime_FINAL [160] is_prime_FINAL-->is_prime_EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 5939#is_prime_EXIT >[193] is_prime_EXIT-->L51-1: AOR: Formula: (= |v_ULTIMATE.start_is_prime_#t~ret5_5| |v_is_prime__#resOutParam_1|) InVars {is_prime__#res=|v_is_prime__#resOutParam_1|} OutVars{ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_5|} AuxVars[] AssignedVars[ULTIMATE.start_is_prime_#t~ret5] LVA: Formula: (and (= |v_is_prime__#in~mInParam_1| (+ v_ULTIMATE.start_is_prime_~n_4 (- 1))) (= |v_is_prime__#in~nInParam_1| v_ULTIMATE.start_is_prime_~n_4)) InVars {ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_4} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_1|, is_prime__#in~n=|v_is_prime__#in~nInParam_1|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n] 5873#L51-1 [242] L51-1-->L85: Formula: (and (<= 1 v_ULTIMATE.start_main_~f1~0_13) (= |v_ULTIMATE.start_main_#t~nondet10_8| v_ULTIMATE.start_main_~f1~0_13) (<= v_ULTIMATE.start_main_~f1~0_13 46340) (= v_ULTIMATE.start_main_~result~0_6 |v_ULTIMATE.start_is_prime_#res_6|) (= |v_ULTIMATE.start_is_prime_#t~ret5_10| |v_ULTIMATE.start_is_prime_#res_6|) (= |v_ULTIMATE.start_main_#t~nondet11_6| v_ULTIMATE.start_main_~f2~0_8)) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_8|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_6|, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_10|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_7|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_5|, ULTIMATE.start_is_prime_#res=|v_ULTIMATE.start_is_prime_#res_6|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_6|, ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_8, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_13, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_6, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_is_prime_#res, ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_~f2~0, ULTIMATE.start_main_~f1~0, ULTIMATE.start_main_~result~0, ULTIMATE.start_is_prime_#t~ret5] 5874#L85 [220] L85-->L89: Formula: (and |v_ULTIMATE.start_main_#t~short13_9| (>= v_ULTIMATE.start_main_~f1~0_9 1) (= v_ULTIMATE.start_main_~result~0_3 1) (>= 46340 v_ULTIMATE.start_main_~f1~0_9)) InVars {ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_9, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_3} OutVars{ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_9|, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_9, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short13] 5886#L89 [177] L89-->L89-1: Formula: |v_ULTIMATE.start_main_#t~short13_1| InVars {ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_1|} OutVars{ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_1|} AuxVars[] AssignedVars[] 5855#L89-1 [176] L89-1-->multENTRY: Formula: (and (= |v_mult_#in~nInParam_3| v_ULTIMATE.start_main_~f1~0_10) (= |v_mult_#in~mInParam_3| v_ULTIMATE.start_main_~f2~0_6)) InVars {ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_6, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_10} OutVars{mult_#in~m=|v_mult_#in~mInParam_3|, mult_#in~n=|v_mult_#in~nInParam_3|} AuxVars[] AssignedVars[mult_#in~m, mult_#in~n]< 5904#multENTRY [180] multENTRY-->L16: Formula: (and (= v_mult_~n_2 |v_mult_#in~n_1|) (= v_mult_~m_6 |v_mult_#in~m_1|)) InVars {mult_#in~m=|v_mult_#in~m_1|, mult_#in~n=|v_mult_#in~n_1|} OutVars{mult_#in~m=|v_mult_#in~m_1|, mult_~n=v_mult_~n_2, mult_~m=v_mult_~m_6, mult_#in~n=|v_mult_#in~n_1|} AuxVars[] AssignedVars[mult_~n, mult_~m] 5853#L16 [207] L16-->L19: Formula: (>= v_mult_~m_9 0) InVars {mult_~m=v_mult_~m_9} OutVars{mult_~m=v_mult_~m_9} AuxVars[] AssignedVars[] 5856#L19 [2020-06-21 23:44:22,444 INFO L796 eck$LassoCheckResult]: Loop: 5856#L19 [230] L19-->L22: Formula: (< 0 v_mult_~m_2) InVars {mult_~m=v_mult_~m_2} OutVars{mult_~m=v_mult_~m_2} AuxVars[] AssignedVars[] 5902#L22 [235] L22-->L25: Formula: (< 1 v_mult_~m_4) InVars {mult_~m=v_mult_~m_4} OutVars{mult_~m=v_mult_~m_4} AuxVars[] AssignedVars[] 5870#L25 [163] L25-->multENTRY: Formula: (and (= |v_mult_#in~mInParam_2| (+ v_mult_~m_11 (- 1))) (= |v_mult_#in~nInParam_2| v_mult_~n_6)) InVars {mult_~n=v_mult_~n_6, mult_~m=v_mult_~m_11} OutVars{mult_#in~m=|v_mult_#in~mInParam_2|, mult_#in~n=|v_mult_#in~nInParam_2|} AuxVars[] AssignedVars[mult_#in~m, mult_#in~n]< 5872#multENTRY [180] multENTRY-->L16: Formula: (and (= v_mult_~n_2 |v_mult_#in~n_1|) (= v_mult_~m_6 |v_mult_#in~m_1|)) InVars {mult_#in~m=|v_mult_#in~m_1|, mult_#in~n=|v_mult_#in~n_1|} OutVars{mult_#in~m=|v_mult_#in~m_1|, mult_~n=v_mult_~n_2, mult_~m=v_mult_~m_6, mult_#in~n=|v_mult_#in~n_1|} AuxVars[] AssignedVars[mult_~n, mult_~m] 5914#L16 [125] L16-->L17: Formula: (< v_mult_~m_7 0) InVars {mult_~m=v_mult_~m_7} OutVars{mult_~m=v_mult_~m_7} AuxVars[] AssignedVars[] 5871#L17 [179] L17-->multENTRY: Formula: (and (= |v_mult_#in~nInParam_1| v_mult_~n_5) (= |v_mult_#in~mInParam_1| (- v_mult_~m_10))) InVars {mult_~n=v_mult_~n_5, mult_~m=v_mult_~m_10} OutVars{mult_#in~m=|v_mult_#in~mInParam_1|, mult_#in~n=|v_mult_#in~nInParam_1|} AuxVars[] AssignedVars[mult_#in~m, mult_#in~n]< 5908#multENTRY [180] multENTRY-->L16: Formula: (and (= v_mult_~n_2 |v_mult_#in~n_1|) (= v_mult_~m_6 |v_mult_#in~m_1|)) InVars {mult_#in~m=|v_mult_#in~m_1|, mult_#in~n=|v_mult_#in~n_1|} OutVars{mult_#in~m=|v_mult_#in~m_1|, mult_~n=v_mult_~n_2, mult_~m=v_mult_~m_6, mult_#in~n=|v_mult_#in~n_1|} AuxVars[] AssignedVars[mult_~n, mult_~m] 5913#L16 [207] L16-->L19: Formula: (>= v_mult_~m_9 0) InVars {mult_~m=v_mult_~m_9} OutVars{mult_~m=v_mult_~m_9} AuxVars[] AssignedVars[] 5856#L19 [2020-06-21 23:44:22,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:44:22,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1131124979, now seen corresponding path program 1 times [2020-06-21 23:44:22,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:44:22,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:44:22,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:22,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 23:44:22,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:22,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:44:22,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1741348632, now seen corresponding path program 1 times [2020-06-21 23:44:22,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:44:22,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:44:22,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:22,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 23:44:22,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:44:22,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-21 23:44:22,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-21 23:44:22,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-21 23:44:22,479 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-21 23:44:22,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-21 23:44:22,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-06-21 23:44:22,479 INFO L87 Difference]: Start difference. First operand 211 states and 295 transitions. cyclomatic complexity: 89 Second operand 5 states. [2020-06-21 23:44:22,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-21 23:44:22,549 INFO L93 Difference]: Finished difference Result 210 states and 292 transitions. [2020-06-21 23:44:22,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-21 23:44:22,552 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 210 states and 292 transitions. [2020-06-21 23:44:22,554 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2020-06-21 23:44:22,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 210 states to 157 states and 208 transitions. [2020-06-21 23:44:22,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2020-06-21 23:44:22,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2020-06-21 23:44:22,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 157 states and 208 transitions. [2020-06-21 23:44:22,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-21 23:44:22,557 INFO L706 BuchiCegarLoop]: Abstraction has 157 states and 208 transitions. [2020-06-21 23:44:22,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states and 208 transitions. [2020-06-21 23:44:22,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 117. [2020-06-21 23:44:22,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-06-21 23:44:22,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 159 transitions. [2020-06-21 23:44:22,561 INFO L729 BuchiCegarLoop]: Abstraction has 117 states and 159 transitions. [2020-06-21 23:44:22,561 INFO L609 BuchiCegarLoop]: Abstraction has 117 states and 159 transitions. [2020-06-21 23:44:22,561 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2020-06-21 23:44:22,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 159 transitions. [2020-06-21 23:44:22,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-06-21 23:44:22,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-21 23:44:22,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-21 23:44:22,563 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-21 23:44:22,563 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-21 23:44:22,563 INFO L794 eck$LassoCheckResult]: Stem: 6313#ULTIMATE.startENTRY [241] ULTIMATE.startENTRY-->L51: Formula: (and (= v_ULTIMATE.start_main_~n~0_7 |v_ULTIMATE.start_is_prime_#in~n_2|) (<= 1 v_ULTIMATE.start_main_~n~0_7) (<= v_ULTIMATE.start_main_~n~0_7 46340) (= v_ULTIMATE.start_is_prime_~n_5 |v_ULTIMATE.start_is_prime_#in~n_2|)) InVars {} OutVars{ULTIMATE.start_is_prime_#in~n=|v_ULTIMATE.start_is_prime_#in~n_2|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_5, ULTIMATE.start_is_prime_#res=|v_ULTIMATE.start_is_prime_#res_5|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_5, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_12, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_8|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_5|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_10|, ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_7, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_8|} AuxVars[] AssignedVars[ULTIMATE.start_is_prime_#in~n, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_is_prime_~n, ULTIMATE.start_is_prime_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~result~0, ULTIMATE.start_main_~f1~0, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_#t~short13, ULTIMATE.start_main_~f2~0, ULTIMATE.start_is_prime_#t~ret5] 6290#L51 [130] L51-->is_prime_ENTRY: Formula: (and (= |v_is_prime__#in~mInParam_1| (+ v_ULTIMATE.start_is_prime_~n_4 (- 1))) (= |v_is_prime__#in~nInParam_1| v_ULTIMATE.start_is_prime_~n_4)) InVars {ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_4} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_1|, is_prime__#in~n=|v_is_prime__#in~nInParam_1|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n]< 6305#is_prime_ENTRY [131] is_prime_ENTRY-->L56: Formula: (and (= v_is_prime__~n_4 |v_is_prime__#in~n_1|) (= v_is_prime__~m_4 |v_is_prime__#in~m_1|)) InVars {is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} OutVars{is_prime__~n=v_is_prime__~n_4, is_prime__~m=v_is_prime__~m_4, is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} AuxVars[] AssignedVars[is_prime__~n, is_prime__~m] 6307#L56 [196] L56-->L59: Formula: (> v_is_prime__~n_6 1) InVars {is_prime__~n=v_is_prime__~n_6} OutVars{is_prime__~n=v_is_prime__~n_6} AuxVars[] AssignedVars[] 6296#L59 [215] L59-->L62: Formula: (< 2 v_is_prime__~n_8) InVars {is_prime__~n=v_is_prime__~n_8} OutVars{is_prime__~n=v_is_prime__~n_8} AuxVars[] AssignedVars[] 6297#L62 [148] L62-->L63: Formula: (< 2 v_is_prime__~n_9) InVars {is_prime__~n=v_is_prime__~n_9} OutVars{is_prime__~n=v_is_prime__~n_9} AuxVars[] AssignedVars[] 6308#L63 [199] L63-->L66: Formula: (> v_is_prime__~m_1 1) InVars {is_prime__~m=v_is_prime__~m_1} OutVars{is_prime__~m=v_is_prime__~m_1} AuxVars[] AssignedVars[] 6301#L66 [158] L66-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~mInParam_4| v_is_prime__~m_6) (= |v_multiple_of_#in~nInParam_4| v_is_prime__~n_10)) InVars {is_prime__~n=v_is_prime__~n_10, is_prime__~m=v_is_prime__~m_6} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_4|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_4|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 6323#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 6325#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 6395#L33 [203] L33-->L36: Formula: (>= v_multiple_of_~n_5 0) InVars {multiple_of_~n=v_multiple_of_~n_5} OutVars{multiple_of_~n=v_multiple_of_~n_5} AuxVars[] AssignedVars[] 6300#L36 [226] L36-->L39: Formula: (< 0 v_multiple_of_~m_7) InVars {multiple_of_~m=v_multiple_of_~m_7} OutVars{multiple_of_~m=v_multiple_of_~m_7} AuxVars[] AssignedVars[] 6302#L39 [228] L39-->L42: Formula: (< 0 v_multiple_of_~n_7) InVars {multiple_of_~n=v_multiple_of_~n_7} OutVars{multiple_of_~n=v_multiple_of_~n_7} AuxVars[] AssignedVars[] 6291#L42 [2020-06-21 23:44:22,564 INFO L796 eck$LassoCheckResult]: Loop: 6291#L42 [141] L42-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~nInParam_3| (+ v_multiple_of_~n_11 (* (- 1) v_multiple_of_~m_11))) (= |v_multiple_of_#in~mInParam_3| v_multiple_of_~m_11)) InVars {multiple_of_~m=v_multiple_of_~m_11, multiple_of_~n=v_multiple_of_~n_11} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_3|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_3|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 6326#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 6329#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 6328#L33 [203] L33-->L36: Formula: (>= v_multiple_of_~n_5 0) InVars {multiple_of_~n=v_multiple_of_~n_5} OutVars{multiple_of_~n=v_multiple_of_~n_5} AuxVars[] AssignedVars[] 6281#L36 [226] L36-->L39: Formula: (< 0 v_multiple_of_~m_7) InVars {multiple_of_~m=v_multiple_of_~m_7} OutVars{multiple_of_~m=v_multiple_of_~m_7} AuxVars[] AssignedVars[] 6394#L39 [228] L39-->L42: Formula: (< 0 v_multiple_of_~n_7) InVars {multiple_of_~n=v_multiple_of_~n_7} OutVars{multiple_of_~n=v_multiple_of_~n_7} AuxVars[] AssignedVars[] 6291#L42 [2020-06-21 23:44:22,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:44:22,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1467599285, now seen corresponding path program 1 times [2020-06-21 23:44:22,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:44:22,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:44:22,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:22,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 23:44:22,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:22,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:22,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:22,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:44:22,574 INFO L82 PathProgramCache]: Analyzing trace with hash 806318160, now seen corresponding path program 1 times [2020-06-21 23:44:22,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:44:22,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:44:22,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:22,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 23:44:22,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:22,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:22,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:44:22,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1060119300, now seen corresponding path program 1 times [2020-06-21 23:44:22,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:44:22,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:44:22,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:22,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 23:44:22,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:22,674 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 23:44:22,674 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 23:44:22,674 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 23:44:22,674 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 23:44:22,674 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-21 23:44:22,674 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:22,674 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 23:44:22,675 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 23:44:22,675 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration12_Loop [2020-06-21 23:44:22,675 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 23:44:22,675 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 23:44:22,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:22,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:22,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:22,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:22,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:22,743 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 23:44:22,744 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:22,748 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 23:44:22,748 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 23:44:22,752 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-21 23:44:22,752 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#res=0} Honda state: {multiple_of_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:22,778 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 23:44:22,779 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:22,813 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-21 23:44:22,813 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 23:44:28,826 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-21 23:44:28,829 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 23:44:28,829 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 23:44:28,830 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 23:44:28,830 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 23:44:28,830 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-21 23:44:28,830 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-21 23:44:28,830 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 23:44:28,830 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 23:44:28,830 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration12_Loop [2020-06-21 23:44:28,830 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 23:44:28,830 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 23:44:28,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:28,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:28,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:28,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:28,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:28,886 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 23:44:28,887 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-21 23:44:28,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:44:28,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:44:28,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 23:44:28,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:44:28,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:44:28,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:44:28,888 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 23:44:28,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 23:44:28,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 23:44:28,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:44:28,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:44:28,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 23:44:28,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:44:28,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:44:28,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:44:28,891 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 23:44:28,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 23:44:28,894 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-21 23:44:28,899 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-06-21 23:44:28,899 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 2 variables to zero. [2020-06-21 23:44:28,900 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-21 23:44:28,900 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-21 23:44:28,900 INFO L518 LassoAnalysis]: Proved termination. [2020-06-21 23:44:28,900 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_~n) = 1*multiple_of_~n Supporting invariants [] [2020-06-21 23:44:28,900 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-21 23:44:28,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:44:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:44:28,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-21 23:44:28,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:44:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:44:28,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-21 23:44:28,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:44:28,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-21 23:44:29,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:44:29,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-21 23:44:29,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:44:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:44:29,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-21 23:44:29,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:44:29,203 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 11 predicates after loop cannibalization [2020-06-21 23:44:29,204 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 11 loop predicates [2020-06-21 23:44:29,204 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 117 states and 159 transitions. cyclomatic complexity: 45 Second operand 7 states. [2020-06-21 23:44:30,182 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 117 states and 159 transitions. cyclomatic complexity: 45. Second operand 7 states. Result 4221 states and 5750 transitions. Complement of second has 1198 states. [2020-06-21 23:44:30,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 21 states 1 stem states 15 non-accepting loop states 4 accepting loop states [2020-06-21 23:44:30,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-21 23:44:30,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 117 transitions. [2020-06-21 23:44:30,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 117 transitions. Stem has 13 letters. Loop has 6 letters. [2020-06-21 23:44:30,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 23:44:30,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 117 transitions. Stem has 19 letters. Loop has 6 letters. [2020-06-21 23:44:30,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 23:44:30,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 117 transitions. Stem has 13 letters. Loop has 12 letters. [2020-06-21 23:44:30,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 23:44:30,188 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4221 states and 5750 transitions. [2020-06-21 23:44:30,233 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2020-06-21 23:44:30,238 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4221 states to 340 states and 489 transitions. [2020-06-21 23:44:30,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-06-21 23:44:30,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-06-21 23:44:30,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 340 states and 489 transitions. [2020-06-21 23:44:30,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-21 23:44:30,239 INFO L706 BuchiCegarLoop]: Abstraction has 340 states and 489 transitions. [2020-06-21 23:44:30,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states and 489 transitions. [2020-06-21 23:44:30,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 210. [2020-06-21 23:44:30,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-06-21 23:44:30,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 284 transitions. [2020-06-21 23:44:30,249 INFO L729 BuchiCegarLoop]: Abstraction has 210 states and 284 transitions. [2020-06-21 23:44:30,249 INFO L609 BuchiCegarLoop]: Abstraction has 210 states and 284 transitions. [2020-06-21 23:44:30,249 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2020-06-21 23:44:30,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 210 states and 284 transitions. [2020-06-21 23:44:30,250 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2020-06-21 23:44:30,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-21 23:44:30,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-21 23:44:30,251 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-21 23:44:30,251 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2020-06-21 23:44:30,252 INFO L794 eck$LassoCheckResult]: Stem: 12025#ULTIMATE.startENTRY [241] ULTIMATE.startENTRY-->L51: Formula: (and (= v_ULTIMATE.start_main_~n~0_7 |v_ULTIMATE.start_is_prime_#in~n_2|) (<= 1 v_ULTIMATE.start_main_~n~0_7) (<= v_ULTIMATE.start_main_~n~0_7 46340) (= v_ULTIMATE.start_is_prime_~n_5 |v_ULTIMATE.start_is_prime_#in~n_2|)) InVars {} OutVars{ULTIMATE.start_is_prime_#in~n=|v_ULTIMATE.start_is_prime_#in~n_2|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_5, ULTIMATE.start_is_prime_#res=|v_ULTIMATE.start_is_prime_#res_5|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_5, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_12, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_8|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_5|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_10|, ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_7, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_8|} AuxVars[] AssignedVars[ULTIMATE.start_is_prime_#in~n, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_is_prime_~n, ULTIMATE.start_is_prime_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~result~0, ULTIMATE.start_main_~f1~0, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_#t~short13, ULTIMATE.start_main_~f2~0, ULTIMATE.start_is_prime_#t~ret5] 11987#L51 [130] L51-->is_prime_ENTRY: Formula: (and (= |v_is_prime__#in~mInParam_1| (+ v_ULTIMATE.start_is_prime_~n_4 (- 1))) (= |v_is_prime__#in~nInParam_1| v_ULTIMATE.start_is_prime_~n_4)) InVars {ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_4} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_1|, is_prime__#in~n=|v_is_prime__#in~nInParam_1|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n]< 12013#is_prime_ENTRY [131] is_prime_ENTRY-->L56: Formula: (and (= v_is_prime__~n_4 |v_is_prime__#in~n_1|) (= v_is_prime__~m_4 |v_is_prime__#in~m_1|)) InVars {is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} OutVars{is_prime__~n=v_is_prime__~n_4, is_prime__~m=v_is_prime__~m_4, is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} AuxVars[] AssignedVars[is_prime__~n, is_prime__~m] 12015#L56 [196] L56-->L59: Formula: (> v_is_prime__~n_6 1) InVars {is_prime__~n=v_is_prime__~n_6} OutVars{is_prime__~n=v_is_prime__~n_6} AuxVars[] AssignedVars[] 12003#L59 [215] L59-->L62: Formula: (< 2 v_is_prime__~n_8) InVars {is_prime__~n=v_is_prime__~n_8} OutVars{is_prime__~n=v_is_prime__~n_8} AuxVars[] AssignedVars[] 12004#L62 [148] L62-->L63: Formula: (< 2 v_is_prime__~n_9) InVars {is_prime__~n=v_is_prime__~n_9} OutVars{is_prime__~n=v_is_prime__~n_9} AuxVars[] AssignedVars[] 12018#L63 [199] L63-->L66: Formula: (> v_is_prime__~m_1 1) InVars {is_prime__~m=v_is_prime__~m_1} OutVars{is_prime__~m=v_is_prime__~m_1} AuxVars[] AssignedVars[] 12022#L66 [158] L66-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~mInParam_4| v_is_prime__~m_6) (= |v_multiple_of_#in~nInParam_4| v_is_prime__~n_10)) InVars {is_prime__~n=v_is_prime__~n_10, is_prime__~m=v_is_prime__~m_6} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_4|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_4|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 12031#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 12066#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 12061#L33 [203] L33-->L36: Formula: (>= v_multiple_of_~n_5 0) InVars {multiple_of_~n=v_multiple_of_~n_5} OutVars{multiple_of_~n=v_multiple_of_~n_5} AuxVars[] AssignedVars[] 12062#L36 [226] L36-->L39: Formula: (< 0 v_multiple_of_~m_7) InVars {multiple_of_~m=v_multiple_of_~m_7} OutVars{multiple_of_~m=v_multiple_of_~m_7} AuxVars[] AssignedVars[] 12021#L39 [228] L39-->L42: Formula: (< 0 v_multiple_of_~n_7) InVars {multiple_of_~n=v_multiple_of_~n_7} OutVars{multiple_of_~n=v_multiple_of_~n_7} AuxVars[] AssignedVars[] 12023#L42 [2020-06-21 23:44:30,252 INFO L796 eck$LassoCheckResult]: Loop: 12023#L42 [141] L42-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~nInParam_3| (+ v_multiple_of_~n_11 (* (- 1) v_multiple_of_~m_11))) (= |v_multiple_of_#in~mInParam_3| v_multiple_of_~m_11)) InVars {multiple_of_~m=v_multiple_of_~m_11, multiple_of_~n=v_multiple_of_~n_11} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_3|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_3|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 12038#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 12132#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 12133#L33 [142] L33-->L34: Formula: (< v_multiple_of_~n_3 0) InVars {multiple_of_~n=v_multiple_of_~n_3} OutVars{multiple_of_~n=v_multiple_of_~n_3} AuxVars[] AssignedVars[] 11982#L34 [127] L34-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~nInParam_2| (- v_multiple_of_~n_10)) (= |v_multiple_of_#in~mInParam_2| v_multiple_of_~m_10)) InVars {multiple_of_~m=v_multiple_of_~m_10, multiple_of_~n=v_multiple_of_~n_10} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_2|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_2|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 12001#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 12035#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 12065#L33 [203] L33-->L36: Formula: (>= v_multiple_of_~n_5 0) InVars {multiple_of_~n=v_multiple_of_~n_5} OutVars{multiple_of_~n=v_multiple_of_~n_5} AuxVars[] AssignedVars[] 12007#L36 [226] L36-->L39: Formula: (< 0 v_multiple_of_~m_7) InVars {multiple_of_~m=v_multiple_of_~m_7} OutVars{multiple_of_~m=v_multiple_of_~m_7} AuxVars[] AssignedVars[] 12009#L39 [228] L39-->L42: Formula: (< 0 v_multiple_of_~n_7) InVars {multiple_of_~n=v_multiple_of_~n_7} OutVars{multiple_of_~n=v_multiple_of_~n_7} AuxVars[] AssignedVars[] 12023#L42 [2020-06-21 23:44:30,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:44:30,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1467599285, now seen corresponding path program 2 times [2020-06-21 23:44:30,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:44:30,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:44:30,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:30,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 23:44:30,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:30,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:30,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:44:30,263 INFO L82 PathProgramCache]: Analyzing trace with hash 2037635822, now seen corresponding path program 1 times [2020-06-21 23:44:30,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:44:30,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:44:30,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:30,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-21 23:44:30,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:30,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:44:30,271 INFO L82 PathProgramCache]: Analyzing trace with hash -824962142, now seen corresponding path program 1 times [2020-06-21 23:44:30,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:44:30,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:44:30,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:30,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 23:44:30,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:44:30,325 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-21 23:44:30,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-21 23:44:30,325 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-21 23:44:30,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 23:44:30,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:44:30,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-21 23:44:30,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:44:30,364 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-21 23:44:30,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-21 23:44:30,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2020-06-21 23:44:30,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-21 23:44:30,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-06-21 23:44:30,534 INFO L87 Difference]: Start difference. First operand 210 states and 284 transitions. cyclomatic complexity: 79 Second operand 8 states. [2020-06-21 23:44:30,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-21 23:44:30,662 INFO L93 Difference]: Finished difference Result 247 states and 335 transitions. [2020-06-21 23:44:30,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-06-21 23:44:30,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 247 states and 335 transitions. [2020-06-21 23:44:30,668 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2020-06-21 23:44:30,671 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 247 states to 247 states and 335 transitions. [2020-06-21 23:44:30,671 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-06-21 23:44:30,671 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-06-21 23:44:30,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 247 states and 335 transitions. [2020-06-21 23:44:30,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-21 23:44:30,671 INFO L706 BuchiCegarLoop]: Abstraction has 247 states and 335 transitions. [2020-06-21 23:44:30,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states and 335 transitions. [2020-06-21 23:44:30,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 221. [2020-06-21 23:44:30,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2020-06-21 23:44:30,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 284 transitions. [2020-06-21 23:44:30,679 INFO L729 BuchiCegarLoop]: Abstraction has 221 states and 284 transitions. [2020-06-21 23:44:30,679 INFO L609 BuchiCegarLoop]: Abstraction has 221 states and 284 transitions. [2020-06-21 23:44:30,680 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2020-06-21 23:44:30,680 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 221 states and 284 transitions. [2020-06-21 23:44:30,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2020-06-21 23:44:30,681 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-21 23:44:30,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-21 23:44:30,682 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-21 23:44:30,682 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1] [2020-06-21 23:44:30,683 INFO L794 eck$LassoCheckResult]: Stem: 12565#ULTIMATE.startENTRY [241] ULTIMATE.startENTRY-->L51: Formula: (and (= v_ULTIMATE.start_main_~n~0_7 |v_ULTIMATE.start_is_prime_#in~n_2|) (<= 1 v_ULTIMATE.start_main_~n~0_7) (<= v_ULTIMATE.start_main_~n~0_7 46340) (= v_ULTIMATE.start_is_prime_~n_5 |v_ULTIMATE.start_is_prime_#in~n_2|)) InVars {} OutVars{ULTIMATE.start_is_prime_#in~n=|v_ULTIMATE.start_is_prime_#in~n_2|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_5, ULTIMATE.start_is_prime_#res=|v_ULTIMATE.start_is_prime_#res_5|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_5, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_12, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_8|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_5|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_10|, ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_7, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_8|} AuxVars[] AssignedVars[ULTIMATE.start_is_prime_#in~n, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_is_prime_~n, ULTIMATE.start_is_prime_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~result~0, ULTIMATE.start_main_~f1~0, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_#t~short13, ULTIMATE.start_main_~f2~0, ULTIMATE.start_is_prime_#t~ret5] 12534#L51 [130] L51-->is_prime_ENTRY: Formula: (and (= |v_is_prime__#in~mInParam_1| (+ v_ULTIMATE.start_is_prime_~n_4 (- 1))) (= |v_is_prime__#in~nInParam_1| v_ULTIMATE.start_is_prime_~n_4)) InVars {ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_4} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_1|, is_prime__#in~n=|v_is_prime__#in~nInParam_1|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n]< 12552#is_prime_ENTRY [131] is_prime_ENTRY-->L56: Formula: (and (= v_is_prime__~n_4 |v_is_prime__#in~n_1|) (= v_is_prime__~m_4 |v_is_prime__#in~m_1|)) InVars {is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} OutVars{is_prime__~n=v_is_prime__~n_4, is_prime__~m=v_is_prime__~m_4, is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} AuxVars[] AssignedVars[is_prime__~n, is_prime__~m] 12554#L56 [196] L56-->L59: Formula: (> v_is_prime__~n_6 1) InVars {is_prime__~n=v_is_prime__~n_6} OutVars{is_prime__~n=v_is_prime__~n_6} AuxVars[] AssignedVars[] 12543#L59 [215] L59-->L62: Formula: (< 2 v_is_prime__~n_8) InVars {is_prime__~n=v_is_prime__~n_8} OutVars{is_prime__~n=v_is_prime__~n_8} AuxVars[] AssignedVars[] 12544#L62 [148] L62-->L63: Formula: (< 2 v_is_prime__~n_9) InVars {is_prime__~n=v_is_prime__~n_9} OutVars{is_prime__~n=v_is_prime__~n_9} AuxVars[] AssignedVars[] 12557#L63 [199] L63-->L66: Formula: (> v_is_prime__~m_1 1) InVars {is_prime__~m=v_is_prime__~m_1} OutVars{is_prime__~m=v_is_prime__~m_1} AuxVars[] AssignedVars[] 12548#L66 [158] L66-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~mInParam_4| v_is_prime__~m_6) (= |v_multiple_of_#in~nInParam_4| v_is_prime__~n_10)) InVars {is_prime__~n=v_is_prime__~n_10, is_prime__~m=v_is_prime__~m_6} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_4|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_4|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 12576#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 12579#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 12647#L33 [203] L33-->L36: Formula: (>= v_multiple_of_~n_5 0) InVars {multiple_of_~n=v_multiple_of_~n_5} OutVars{multiple_of_~n=v_multiple_of_~n_5} AuxVars[] AssignedVars[] 12547#L36 [226] L36-->L39: Formula: (< 0 v_multiple_of_~m_7) InVars {multiple_of_~m=v_multiple_of_~m_7} OutVars{multiple_of_~m=v_multiple_of_~m_7} AuxVars[] AssignedVars[] 12549#L39 [228] L39-->L42: Formula: (< 0 v_multiple_of_~n_7) InVars {multiple_of_~n=v_multiple_of_~n_7} OutVars{multiple_of_~n=v_multiple_of_~n_7} AuxVars[] AssignedVars[] 12559#L42 [141] L42-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~nInParam_3| (+ v_multiple_of_~n_11 (* (- 1) v_multiple_of_~m_11))) (= |v_multiple_of_#in~mInParam_3| v_multiple_of_~m_11)) InVars {multiple_of_~m=v_multiple_of_~m_11, multiple_of_~n=v_multiple_of_~n_11} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_3|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_3|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 12582#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 12694#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 12626#L33 [203] L33-->L36: Formula: (>= v_multiple_of_~n_5 0) InVars {multiple_of_~n=v_multiple_of_~n_5} OutVars{multiple_of_~n=v_multiple_of_~n_5} AuxVars[] AssignedVars[] 12633#L36 [226] L36-->L39: Formula: (< 0 v_multiple_of_~m_7) InVars {multiple_of_~m=v_multiple_of_~m_7} OutVars{multiple_of_~m=v_multiple_of_~m_7} AuxVars[] AssignedVars[] 12630#L39 [228] L39-->L42: Formula: (< 0 v_multiple_of_~n_7) InVars {multiple_of_~n=v_multiple_of_~n_7} OutVars{multiple_of_~n=v_multiple_of_~n_7} AuxVars[] AssignedVars[] 12522#L42 [141] L42-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~nInParam_3| (+ v_multiple_of_~n_11 (* (- 1) v_multiple_of_~m_11))) (= |v_multiple_of_#in~mInParam_3| v_multiple_of_~m_11)) InVars {multiple_of_~m=v_multiple_of_~m_11, multiple_of_~n=v_multiple_of_~n_11} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_3|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_3|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 12628#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 12625#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 12521#L33 [2020-06-21 23:44:30,683 INFO L796 eck$LassoCheckResult]: Loop: 12521#L33 [142] L33-->L34: Formula: (< v_multiple_of_~n_3 0) InVars {multiple_of_~n=v_multiple_of_~n_3} OutVars{multiple_of_~n=v_multiple_of_~n_3} AuxVars[] AssignedVars[] 12523#L34 [127] L34-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~nInParam_2| (- v_multiple_of_~n_10)) (= |v_multiple_of_#in~mInParam_2| v_multiple_of_~m_10)) InVars {multiple_of_~m=v_multiple_of_~m_10, multiple_of_~n=v_multiple_of_~n_10} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_2|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_2|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 12536#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 12567#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 12568#L33 [203] L33-->L36: Formula: (>= v_multiple_of_~n_5 0) InVars {multiple_of_~n=v_multiple_of_~n_5} OutVars{multiple_of_~n=v_multiple_of_~n_5} AuxVars[] AssignedVars[] 12611#L36 [226] L36-->L39: Formula: (< 0 v_multiple_of_~m_7) InVars {multiple_of_~m=v_multiple_of_~m_7} OutVars{multiple_of_~m=v_multiple_of_~m_7} AuxVars[] AssignedVars[] 12646#L39 [228] L39-->L42: Formula: (< 0 v_multiple_of_~n_7) InVars {multiple_of_~n=v_multiple_of_~n_7} OutVars{multiple_of_~n=v_multiple_of_~n_7} AuxVars[] AssignedVars[] 12540#L42 [141] L42-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~nInParam_3| (+ v_multiple_of_~n_11 (* (- 1) v_multiple_of_~m_11))) (= |v_multiple_of_#in~mInParam_3| v_multiple_of_~m_11)) InVars {multiple_of_~m=v_multiple_of_~m_11, multiple_of_~n=v_multiple_of_~n_11} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_3|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_3|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 12681#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 12679#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 12677#L33 [203] L33-->L36: Formula: (>= v_multiple_of_~n_5 0) InVars {multiple_of_~n=v_multiple_of_~n_5} OutVars{multiple_of_~n=v_multiple_of_~n_5} AuxVars[] AssignedVars[] 12633#L36 [226] L36-->L39: Formula: (< 0 v_multiple_of_~m_7) InVars {multiple_of_~m=v_multiple_of_~m_7} OutVars{multiple_of_~m=v_multiple_of_~m_7} AuxVars[] AssignedVars[] 12630#L39 [228] L39-->L42: Formula: (< 0 v_multiple_of_~n_7) InVars {multiple_of_~n=v_multiple_of_~n_7} OutVars{multiple_of_~n=v_multiple_of_~n_7} AuxVars[] AssignedVars[] 12522#L42 [141] L42-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~nInParam_3| (+ v_multiple_of_~n_11 (* (- 1) v_multiple_of_~m_11))) (= |v_multiple_of_#in~mInParam_3| v_multiple_of_~m_11)) InVars {multiple_of_~m=v_multiple_of_~m_11, multiple_of_~n=v_multiple_of_~n_11} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_3|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_3|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 12628#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 12625#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 12521#L33 [2020-06-21 23:44:30,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:44:30,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1119680250, now seen corresponding path program 2 times [2020-06-21 23:44:30,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:44:30,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:44:30,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:30,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 23:44:30,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:30,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:44:30,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1838862597, now seen corresponding path program 2 times [2020-06-21 23:44:30,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:44:30,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:44:30,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:30,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-21 23:44:30,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:30,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:30,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:44:30,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1759819262, now seen corresponding path program 2 times [2020-06-21 23:44:30,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:44:30,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:44:30,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:30,706 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-21 23:44:30,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:44:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:44:30,767 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 41 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-06-21 23:44:30,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-21 23:44:30,768 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-21 23:44:30,779 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-21 23:44:30,795 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-21 23:44:30,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-21 23:44:30,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-21 23:44:30,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:44:30,875 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 39 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-06-21 23:44:30,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-21 23:44:30,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2020-06-21 23:44:31,132 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 23:44:31,133 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 23:44:31,133 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 23:44:31,133 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 23:44:31,133 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-21 23:44:31,133 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:31,133 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 23:44:31,133 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 23:44:31,133 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration14_Loop [2020-06-21 23:44:31,134 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 23:44:31,134 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 23:44:31,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:31,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:31,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:31,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:31,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:31,190 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 23:44:31,190 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:31,193 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 23:44:31,193 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 23:44:31,197 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-21 23:44:31,197 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#t~ret3=0} Honda state: {multiple_of_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:31,231 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 23:44:31,231 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:44:31,266 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-21 23:44:31,266 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 23:44:43,304 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2020-06-21 23:44:43,308 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 23:44:43,308 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 23:44:43,308 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 23:44:43,309 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 23:44:43,309 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-21 23:44:43,309 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-21 23:44:43,309 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 23:44:43,309 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 23:44:43,309 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration14_Loop [2020-06-21 23:44:43,309 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 23:44:43,309 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 23:44:43,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:43,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:43,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:43,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:43,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:44:43,371 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 23:44:43,372 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-21 23:44:43,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:44:43,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:44:43,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 23:44:43,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:44:43,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:44:43,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:44:43,374 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 23:44:43,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 23:44:43,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 23:44:43,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:44:43,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:44:43,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 23:44:43,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:44:43,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:44:43,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:44:43,376 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 23:44:43,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 23:44:43,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 23:44:43,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:44:43,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:44:43,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 23:44:43,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:44:43,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:44:43,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:44:43,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 23:44:43,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 23:44:43,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 23:44:43,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:44:43,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:44:43,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 23:44:43,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:44:43,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:44:43,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:44:43,380 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 23:44:43,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 23:44:43,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 23:44:43,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:44:43,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:44:43,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 23:44:43,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:44:43,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:44:43,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:44:43,382 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 23:44:43,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 23:44:43,386 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-21 23:44:43,388 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-21 23:44:43,389 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-21 23:44:43,389 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-21 23:44:43,389 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-21 23:44:43,389 INFO L518 LassoAnalysis]: Proved termination. [2020-06-21 23:44:43,389 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_~n) = -1*multiple_of_~n Supporting invariants [] [2020-06-21 23:44:43,390 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-21 23:44:43,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:44:43,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:44:43,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-21 23:44:43,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:44:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:44:43,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 19 conjunts are in the unsatisfiable core [2020-06-21 23:44:43,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:44:43,595 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-21 23:44:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:43,673 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-21 23:44:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:43,690 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-21 23:44:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:43,706 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-21 23:44:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:43,724 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-21 23:44:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:43,741 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-21 23:44:43,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:43,758 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-21 23:44:43,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:44:43,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-21 23:44:43,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:44:43,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:44:43,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 20 conjunts are in the unsatisfiable core [2020-06-21 23:44:43,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:44:44,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:44:44,076 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-21 23:44:44,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:44:44,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 19 conjunts are in the unsatisfiable core [2020-06-21 23:44:44,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:44:44,117 INFO L98 LoopCannibalizer]: 10 predicates before loop cannibalization 21 predicates after loop cannibalization [2020-06-21 23:44:44,117 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 21 loop predicates [2020-06-21 23:44:44,118 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 221 states and 284 transitions. cyclomatic complexity: 68 Second operand 12 states. [2020-06-21 23:45:07,710 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 221 states and 284 transitions. cyclomatic complexity: 68. Second operand 12 states. Result 210542 states and 264874 transitions. Complement of second has 72429 states. [2020-06-21 23:45:07,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 72 states 1 stem states 67 non-accepting loop states 3 accepting loop states [2020-06-21 23:45:07,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-06-21 23:45:07,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 311 transitions. [2020-06-21 23:45:07,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 311 transitions. Stem has 22 letters. Loop has 16 letters. [2020-06-21 23:45:07,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 23:45:07,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 311 transitions. Stem has 38 letters. Loop has 16 letters. [2020-06-21 23:45:07,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 23:45:07,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 311 transitions. Stem has 22 letters. Loop has 32 letters. [2020-06-21 23:45:07,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 23:45:07,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 210542 states and 264874 transitions. [2020-06-21 23:45:08,896 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 53 [2020-06-21 23:45:08,902 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 210542 states to 578 states and 692 transitions. [2020-06-21 23:45:08,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2020-06-21 23:45:08,902 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2020-06-21 23:45:08,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 578 states and 692 transitions. [2020-06-21 23:45:08,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-21 23:45:08,903 INFO L706 BuchiCegarLoop]: Abstraction has 578 states and 692 transitions. [2020-06-21 23:45:08,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states and 692 transitions. [2020-06-21 23:45:08,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 299. [2020-06-21 23:45:08,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2020-06-21 23:45:08,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 347 transitions. [2020-06-21 23:45:08,916 INFO L729 BuchiCegarLoop]: Abstraction has 299 states and 347 transitions. [2020-06-21 23:45:08,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-06-21 23:45:08,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2020-06-21 23:45:08,917 INFO L87 Difference]: Start difference. First operand 299 states and 347 transitions. Second operand 16 states. [2020-06-21 23:45:09,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-21 23:45:09,389 INFO L93 Difference]: Finished difference Result 344 states and 410 transitions. [2020-06-21 23:45:09,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-06-21 23:45:09,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 344 states and 410 transitions. [2020-06-21 23:45:09,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-06-21 23:45:09,398 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 344 states to 344 states and 410 transitions. [2020-06-21 23:45:09,398 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-06-21 23:45:09,398 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-06-21 23:45:09,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 344 states and 410 transitions. [2020-06-21 23:45:09,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-21 23:45:09,399 INFO L706 BuchiCegarLoop]: Abstraction has 344 states and 410 transitions. [2020-06-21 23:45:09,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states and 410 transitions. [2020-06-21 23:45:09,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 299. [2020-06-21 23:45:09,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2020-06-21 23:45:09,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 347 transitions. [2020-06-21 23:45:09,408 INFO L729 BuchiCegarLoop]: Abstraction has 299 states and 347 transitions. [2020-06-21 23:45:09,408 INFO L609 BuchiCegarLoop]: Abstraction has 299 states and 347 transitions. [2020-06-21 23:45:09,408 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2020-06-21 23:45:09,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 299 states and 347 transitions. [2020-06-21 23:45:09,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-21 23:45:09,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-21 23:45:09,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-21 23:45:09,410 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-21 23:45:09,410 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2020-06-21 23:45:09,410 INFO L794 eck$LassoCheckResult]: Stem: 296980#ULTIMATE.startENTRY [241] ULTIMATE.startENTRY-->L51: Formula: (and (= v_ULTIMATE.start_main_~n~0_7 |v_ULTIMATE.start_is_prime_#in~n_2|) (<= 1 v_ULTIMATE.start_main_~n~0_7) (<= v_ULTIMATE.start_main_~n~0_7 46340) (= v_ULTIMATE.start_is_prime_~n_5 |v_ULTIMATE.start_is_prime_#in~n_2|)) InVars {} OutVars{ULTIMATE.start_is_prime_#in~n=|v_ULTIMATE.start_is_prime_#in~n_2|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_5, ULTIMATE.start_is_prime_#res=|v_ULTIMATE.start_is_prime_#res_5|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_5, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_12, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_8|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_5|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_10|, ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_7, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_8|} AuxVars[] AssignedVars[ULTIMATE.start_is_prime_#in~n, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_is_prime_~n, ULTIMATE.start_is_prime_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~result~0, ULTIMATE.start_main_~f1~0, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_#t~short13, ULTIMATE.start_main_~f2~0, ULTIMATE.start_is_prime_#t~ret5] 296957#L51 [130] L51-->is_prime_ENTRY: Formula: (and (= |v_is_prime__#in~mInParam_1| (+ v_ULTIMATE.start_is_prime_~n_4 (- 1))) (= |v_is_prime__#in~nInParam_1| v_ULTIMATE.start_is_prime_~n_4)) InVars {ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_4} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_1|, is_prime__#in~n=|v_is_prime__#in~nInParam_1|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n]< 296972#is_prime_ENTRY [131] is_prime_ENTRY-->L56: Formula: (and (= v_is_prime__~n_4 |v_is_prime__#in~n_1|) (= v_is_prime__~m_4 |v_is_prime__#in~m_1|)) InVars {is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} OutVars{is_prime__~n=v_is_prime__~n_4, is_prime__~m=v_is_prime__~m_4, is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} AuxVars[] AssignedVars[is_prime__~n, is_prime__~m] 296976#L56 [196] L56-->L59: Formula: (> v_is_prime__~n_6 1) InVars {is_prime__~n=v_is_prime__~n_6} OutVars{is_prime__~n=v_is_prime__~n_6} AuxVars[] AssignedVars[] 296965#L59 [215] L59-->L62: Formula: (< 2 v_is_prime__~n_8) InVars {is_prime__~n=v_is_prime__~n_8} OutVars{is_prime__~n=v_is_prime__~n_8} AuxVars[] AssignedVars[] 296966#L62 [148] L62-->L63: Formula: (< 2 v_is_prime__~n_9) InVars {is_prime__~n=v_is_prime__~n_9} OutVars{is_prime__~n=v_is_prime__~n_9} AuxVars[] AssignedVars[] 296973#L63 [199] L63-->L66: Formula: (> v_is_prime__~m_1 1) InVars {is_prime__~m=v_is_prime__~m_1} OutVars{is_prime__~m=v_is_prime__~m_1} AuxVars[] AssignedVars[] 296981#L66 [158] L66-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~mInParam_4| v_is_prime__~m_6) (= |v_multiple_of_#in~nInParam_4| v_is_prime__~n_10)) InVars {is_prime__~n=v_is_prime__~n_10, is_prime__~m=v_is_prime__~m_6} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_4|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_4|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 296995#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 296998#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 297013#L33 [203] L33-->L36: Formula: (>= v_multiple_of_~n_5 0) InVars {multiple_of_~n=v_multiple_of_~n_5} OutVars{multiple_of_~n=v_multiple_of_~n_5} AuxVars[] AssignedVars[] 297014#L36 [226] L36-->L39: Formula: (< 0 v_multiple_of_~m_7) InVars {multiple_of_~m=v_multiple_of_~m_7} OutVars{multiple_of_~m=v_multiple_of_~m_7} AuxVars[] AssignedVars[] 296984#L39 [228] L39-->L42: Formula: (< 0 v_multiple_of_~n_7) InVars {multiple_of_~n=v_multiple_of_~n_7} OutVars{multiple_of_~n=v_multiple_of_~n_7} AuxVars[] AssignedVars[] 296985#L42 [141] L42-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~nInParam_3| (+ v_multiple_of_~n_11 (* (- 1) v_multiple_of_~m_11))) (= |v_multiple_of_#in~mInParam_3| v_multiple_of_~m_11)) InVars {multiple_of_~m=v_multiple_of_~m_11, multiple_of_~n=v_multiple_of_~n_11} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_3|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_3|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 297024#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 297023#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 297019#L33 [203] L33-->L36: Formula: (>= v_multiple_of_~n_5 0) InVars {multiple_of_~n=v_multiple_of_~n_5} OutVars{multiple_of_~n=v_multiple_of_~n_5} AuxVars[] AssignedVars[] 297022#L36 [226] L36-->L39: Formula: (< 0 v_multiple_of_~m_7) InVars {multiple_of_~m=v_multiple_of_~m_7} OutVars{multiple_of_~m=v_multiple_of_~m_7} AuxVars[] AssignedVars[] 297021#L39 [228] L39-->L42: Formula: (< 0 v_multiple_of_~n_7) InVars {multiple_of_~n=v_multiple_of_~n_7} OutVars{multiple_of_~n=v_multiple_of_~n_7} AuxVars[] AssignedVars[] 296946#L42 [141] L42-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~nInParam_3| (+ v_multiple_of_~n_11 (* (- 1) v_multiple_of_~m_11))) (= |v_multiple_of_#in~mInParam_3| v_multiple_of_~m_11)) InVars {multiple_of_~m=v_multiple_of_~m_11, multiple_of_~n=v_multiple_of_~n_11} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_3|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_3|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 297020#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 297018#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 296945#L33 [142] L33-->L34: Formula: (< v_multiple_of_~n_3 0) InVars {multiple_of_~n=v_multiple_of_~n_3} OutVars{multiple_of_~n=v_multiple_of_~n_3} AuxVars[] AssignedVars[] 296947#L34 [127] L34-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~nInParam_2| (- v_multiple_of_~n_10)) (= |v_multiple_of_#in~mInParam_2| v_multiple_of_~m_10)) InVars {multiple_of_~m=v_multiple_of_~m_10, multiple_of_~n=v_multiple_of_~n_10} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_2|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_2|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 297025#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 296991#L30 [2020-06-21 23:45:09,411 INFO L796 eck$LassoCheckResult]: Loop: 296991#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 296992#L33 [203] L33-->L36: Formula: (>= v_multiple_of_~n_5 0) InVars {multiple_of_~n=v_multiple_of_~n_5} OutVars{multiple_of_~n=v_multiple_of_~n_5} AuxVars[] AssignedVars[] 296969#L36 [226] L36-->L39: Formula: (< 0 v_multiple_of_~m_7) InVars {multiple_of_~m=v_multiple_of_~m_7} OutVars{multiple_of_~m=v_multiple_of_~m_7} AuxVars[] AssignedVars[] 296970#L39 [228] L39-->L42: Formula: (< 0 v_multiple_of_~n_7) InVars {multiple_of_~n=v_multiple_of_~n_7} OutVars{multiple_of_~n=v_multiple_of_~n_7} AuxVars[] AssignedVars[] 297001#L42 [141] L42-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~nInParam_3| (+ v_multiple_of_~n_11 (* (- 1) v_multiple_of_~m_11))) (= |v_multiple_of_#in~mInParam_3| v_multiple_of_~m_11)) InVars {multiple_of_~m=v_multiple_of_~m_11, multiple_of_~n=v_multiple_of_~n_11} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_3|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_3|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 297002#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 297026#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 297053#L33 [142] L33-->L34: Formula: (< v_multiple_of_~n_3 0) InVars {multiple_of_~n=v_multiple_of_~n_3} OutVars{multiple_of_~n=v_multiple_of_~n_3} AuxVars[] AssignedVars[] 296947#L34 [127] L34-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~nInParam_2| (- v_multiple_of_~n_10)) (= |v_multiple_of_#in~mInParam_2| v_multiple_of_~m_10)) InVars {multiple_of_~m=v_multiple_of_~m_10, multiple_of_~n=v_multiple_of_~n_10} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_2|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_2|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 297025#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 296991#L30 [2020-06-21 23:45:09,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:45:09,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1678447598, now seen corresponding path program 3 times [2020-06-21 23:45:09,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:45:09,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:45:09,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:45:09,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-21 23:45:09,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:45:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:45:09,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:45:09,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:45:09,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1239768658, now seen corresponding path program 3 times [2020-06-21 23:45:09,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:45:09,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:45:09,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:45:09,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-21 23:45:09,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:45:09,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:45:09,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:45:09,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:45:09,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1721536165, now seen corresponding path program 4 times [2020-06-21 23:45:09,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:45:09,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:45:09,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:45:09,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-21 23:45:09,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:45:09,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:45:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:45:10,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.06 11:45:10 BasicIcfg [2020-06-21 23:45:10,076 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-21 23:45:10,077 INFO L168 Benchmark]: Toolchain (without parser) took 57488.11 ms. Allocated memory was 649.6 MB in the beginning and 4.7 GB in the end (delta: 4.1 GB). Free memory was 563.1 MB in the beginning and 1.2 GB in the end (delta: -667.8 MB). Peak memory consumption was 3.4 GB. Max. memory is 50.3 GB. [2020-06-21 23:45:10,079 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-21 23:45:10,079 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.53 ms. Allocated memory was 649.6 MB in the beginning and 697.8 MB in the end (delta: 48.2 MB). Free memory was 563.1 MB in the beginning and 661.0 MB in the end (delta: -97.9 MB). Peak memory consumption was 28.6 MB. Max. memory is 50.3 GB. [2020-06-21 23:45:10,080 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.88 ms. Allocated memory is still 697.8 MB. Free memory was 661.0 MB in the beginning and 659.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-21 23:45:10,081 INFO L168 Benchmark]: Boogie Preprocessor took 20.14 ms. Allocated memory is still 697.8 MB. Free memory was 659.7 MB in the beginning and 658.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-21 23:45:10,081 INFO L168 Benchmark]: RCFGBuilder took 318.72 ms. Allocated memory is still 697.8 MB. Free memory was 658.3 MB in the beginning and 635.9 MB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 50.3 GB. [2020-06-21 23:45:10,082 INFO L168 Benchmark]: BlockEncodingV2 took 119.01 ms. Allocated memory is still 697.8 MB. Free memory was 635.9 MB in the beginning and 627.9 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. [2020-06-21 23:45:10,082 INFO L168 Benchmark]: TraceAbstraction took 198.27 ms. Allocated memory is still 697.8 MB. Free memory was 626.5 MB in the beginning and 610.6 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 50.3 GB. [2020-06-21 23:45:10,082 INFO L168 Benchmark]: BuchiAutomizer took 56486.31 ms. Allocated memory was 697.8 MB in the beginning and 4.7 GB in the end (delta: 4.0 GB). Free memory was 610.6 MB in the beginning and 1.2 GB in the end (delta: -620.4 MB). Peak memory consumption was 3.4 GB. Max. memory is 50.3 GB. [2020-06-21 23:45:10,086 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 49 locations, 71 edges - StatisticsResult: Encoded RCFG 40 locations, 65 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 303.53 ms. Allocated memory was 649.6 MB in the beginning and 697.8 MB in the end (delta: 48.2 MB). Free memory was 563.1 MB in the beginning and 661.0 MB in the end (delta: -97.9 MB). Peak memory consumption was 28.6 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 36.88 ms. Allocated memory is still 697.8 MB. Free memory was 661.0 MB in the beginning and 659.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 20.14 ms. Allocated memory is still 697.8 MB. Free memory was 659.7 MB in the beginning and 658.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 318.72 ms. Allocated memory is still 697.8 MB. Free memory was 658.3 MB in the beginning and 635.9 MB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 119.01 ms. Allocated memory is still 697.8 MB. Free memory was 635.9 MB in the beginning and 627.9 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. * TraceAbstraction took 198.27 ms. Allocated memory is still 697.8 MB. Free memory was 626.5 MB in the beginning and 610.6 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 56486.31 ms. Allocated memory was 697.8 MB in the beginning and 4.7 GB in the end (delta: 4.0 GB). Free memory was 610.6 MB in the beginning and 1.2 GB in the end (delta: -620.4 MB). Peak memory consumption was 3.4 GB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - AllSpecificationsHoldResult: All specifications hold We were not able to verify any specifiation because the program does not contain any specification. - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 0 error locations. SAFE Result, 0.1s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 34 PreInvPairs, 34 NumberOfFragments, 13 HoareAnnotationTreeSize, 34 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 20 terminating modules (13 trivial, 0 deterministic, 7 nondeterministic) and one nonterminating remainder module.One nondeterministic module has affine ranking function \old(m) and consists of 11 locations. One nondeterministic module has affine ranking function m and consists of 6 locations. One nondeterministic module has affine ranking function -1 * \old(m) and consists of 6 locations. One nondeterministic module has affine ranking function -1 * \old(n) and consists of 5 locations. One nondeterministic module has affine ranking function m and consists of 9 locations. One nondeterministic module has affine ranking function n and consists of 21 locations. One nondeterministic module has affine ranking function -1 * n and consists of 72 locations. 13 modules have a trivial ranking function, the largest among these consists of 16 locations. The remainder module has 299 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 56.4s and 15 iterations. TraceHistogramMax:4. Analysis of lassos took 25.1s. Construction of modules took 3.0s. Büchi inclusion checks took 26.4s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 16. Automata minimization 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 854 StatesRemovedByMinimization, 18 NontrivialMinimizations. Non-live state removal took 1.3s Buchi closure took 0.0s. Biggest automaton had 299 states and ocurred in iteration 14. Nontrivial modules had stage [7, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 3/19 HoareTripleCheckerStatistics: 732 SDtfs, 1056 SDslu, 2634 SDs, 0 SdLazy, 4018 SolverSat, 783 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time LassoAnalysisResults: nont1 unkn0 SFLI5 SFLT1 conc1 concLT2 SILN0 SILU0 SILI1 SILT4 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax100 hnf99 lsp82 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq174 hnf91 smp100 dnf100 smp100 tf109 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 21 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 20.8s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 30]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6c74eec9=0, \result=0, f1=0, m=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@760c5848=0, n=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7e40f225=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@19aad7be=0, result=0, f2=0, m=2, n=1, \result=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@32f56df2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@74045163=0, \old(n)=1, \old(m)=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@71f62782=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@62ac6339=0, n=0, \old(n)=0, \result=0, \old(m)=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@46f01283=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@63dc914e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@78b64fa9=0, \old(n)=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@5129c73a=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 30]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L75] int n = __VERIFIER_nondet_int(); [L76] COND FALSE !(n < 1 || n > 46340) [L51] CALL is_prime_(n, n - 1) [L56] COND FALSE !(n <= 1) [L59] COND FALSE !(n == 2) [L62] COND TRUE n > 2 [L63] COND FALSE !(m <= 1) [L66] CALL multiple_of(n, m) [L30] COND FALSE !(m < 0) [L33] COND FALSE !(n < 0) [L36] COND FALSE !(m == 0) [L39] COND FALSE !(n == 0) [L42] CALL multiple_of(n - m, m) [L30] COND FALSE !(m < 0) [L33] COND FALSE !(n < 0) [L36] COND FALSE !(m == 0) [L39] COND FALSE !(n == 0) [L42] CALL multiple_of(n - m, m) [L30] COND FALSE !(m < 0) [L33] COND TRUE n < 0 [L34] CALL multiple_of(-n, m) Loop: [L30] COND FALSE !(m < 0) [L33] COND FALSE !(n < 0) [L36] COND FALSE !(m == 0) [L39] COND FALSE !(n == 0) [L42] CALL multiple_of(n - m, m) [L30] COND FALSE !(m < 0) [L33] COND TRUE n < 0 [L34] CALL multiple_of(-n, m) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! !ENTRY org.eclipse.core.resources 2 10035 2020-06-21 23:45:10.322 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check