./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/recursive/Primes.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/recursive/Primes.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16beca065b3aeb336c54dcf96f3abbe61553e7d28b28c1a40f525ad89a5da56e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 16:17:46,421 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 16:17:46,479 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-04 16:17:46,483 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 16:17:46,484 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 16:17:46,484 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 16:17:46,498 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 16:17:46,498 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 16:17:46,498 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 16:17:46,499 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 16:17:46,499 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 16:17:46,499 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 16:17:46,499 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 16:17:46,499 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 16:17:46,499 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 16:17:46,499 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 16:17:46,500 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 16:17:46,500 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 16:17:46,500 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 16:17:46,500 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 16:17:46,500 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 16:17:46,500 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 16:17:46,500 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 16:17:46,500 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 16:17:46,500 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 16:17:46,500 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 16:17:46,501 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 16:17:46,501 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 16:17:46,501 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 16:17:46,501 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 16:17:46,501 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 16:17:46,501 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 16:17:46,501 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 16:17:46,501 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 16:17:46,501 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 16:17:46,501 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 16:17:46,501 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 16:17:46,502 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 16:17:46,502 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 16:17:46,502 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 16:17:46,502 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 16beca065b3aeb336c54dcf96f3abbe61553e7d28b28c1a40f525ad89a5da56e [2025-03-04 16:17:46,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 16:17:46,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 16:17:46,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 16:17:46,736 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 16:17:46,736 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 16:17:46,737 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Primes.c [2025-03-04 16:17:47,837 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8447ab669/a56737437ca14c2c9df80ad58a659bed/FLAGc5d5b20b9 [2025-03-04 16:17:48,064 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 16:17:48,064 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Primes.c [2025-03-04 16:17:48,070 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8447ab669/a56737437ca14c2c9df80ad58a659bed/FLAGc5d5b20b9 [2025-03-04 16:17:48,081 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8447ab669/a56737437ca14c2c9df80ad58a659bed [2025-03-04 16:17:48,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 16:17:48,085 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 16:17:48,086 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 16:17:48,086 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 16:17:48,090 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 16:17:48,091 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:17:48" (1/1) ... [2025-03-04 16:17:48,092 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bea0c72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:17:48, skipping insertion in model container [2025-03-04 16:17:48,092 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:17:48" (1/1) ... [2025-03-04 16:17:48,106 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 16:17:48,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 16:17:48,231 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 16:17:48,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 16:17:48,260 INFO L204 MainTranslator]: Completed translation [2025-03-04 16:17:48,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:17:48 WrapperNode [2025-03-04 16:17:48,261 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 16:17:48,261 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 16:17:48,262 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 16:17:48,262 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 16:17:48,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:17:48" (1/1) ... [2025-03-04 16:17:48,274 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:17:48" (1/1) ... [2025-03-04 16:17:48,286 INFO L138 Inliner]: procedures = 16, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 51 [2025-03-04 16:17:48,287 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 16:17:48,288 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 16:17:48,288 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 16:17:48,288 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 16:17:48,292 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:17:48" (1/1) ... [2025-03-04 16:17:48,293 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:17:48" (1/1) ... [2025-03-04 16:17:48,298 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:17:48" (1/1) ... [2025-03-04 16:17:48,311 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 16:17:48,311 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:17:48" (1/1) ... [2025-03-04 16:17:48,311 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:17:48" (1/1) ... [2025-03-04 16:17:48,314 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:17:48" (1/1) ... [2025-03-04 16:17:48,314 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:17:48" (1/1) ... [2025-03-04 16:17:48,318 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:17:48" (1/1) ... [2025-03-04 16:17:48,319 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:17:48" (1/1) ... [2025-03-04 16:17:48,319 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 16:17:48,320 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 16:17:48,320 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 16:17:48,320 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 16:17:48,321 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:17:48" (1/1) ... [2025-03-04 16:17:48,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:48,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:48,348 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:48,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-04 16:17:48,371 INFO L130 BoogieDeclarations]: Found specification of procedure multiple_of [2025-03-04 16:17:48,371 INFO L138 BoogieDeclarations]: Found implementation of procedure multiple_of [2025-03-04 16:17:48,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 16:17:48,371 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2025-03-04 16:17:48,371 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2025-03-04 16:17:48,371 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime_ [2025-03-04 16:17:48,371 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime_ [2025-03-04 16:17:48,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 16:17:48,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 16:17:48,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 16:17:48,429 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 16:17:48,430 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 16:17:48,473 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L33: havoc #t~ret6; [2025-03-04 16:17:48,473 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L44: havoc #t~ret8; [2025-03-04 16:17:48,473 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L36: havoc #t~ret7; [2025-03-04 16:17:48,498 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L27: havoc #t~ret5; [2025-03-04 16:17:48,498 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19: havoc #t~ret4; [2025-03-04 16:17:48,561 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L53: havoc is_prime_#t~ret9#1; [2025-03-04 16:17:48,580 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L71: havoc #t~ret11; [2025-03-04 16:17:48,600 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-04 16:17:48,600 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 16:17:48,611 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 16:17:48,611 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 16:17:48,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:17:48 BoogieIcfgContainer [2025-03-04 16:17:48,612 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 16:17:48,613 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 16:17:48,613 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 16:17:48,617 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 16:17:48,618 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:17:48,619 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 04:17:48" (1/3) ... [2025-03-04 16:17:48,620 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b54d983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 04:17:48, skipping insertion in model container [2025-03-04 16:17:48,620 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:17:48,620 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:17:48" (2/3) ... [2025-03-04 16:17:48,621 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b54d983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 04:17:48, skipping insertion in model container [2025-03-04 16:17:48,621 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:17:48,621 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:17:48" (3/3) ... [2025-03-04 16:17:48,622 INFO L363 chiAutomizerObserver]: Analyzing ICFG Primes.c [2025-03-04 16:17:48,664 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 16:17:48,664 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 16:17:48,664 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 16:17:48,664 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 16:17:48,664 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 16:17:48,665 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 16:17:48,665 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 16:17:48,665 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 16:17:48,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 38 states have internal predecessors, (55), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 16:17:48,683 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2025-03-04 16:17:48,684 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:17:48,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:17:48,689 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 16:17:48,690 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:17:48,690 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 16:17:48,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 38 states have internal predecessors, (55), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 16:17:48,693 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2025-03-04 16:17:48,694 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:17:48,694 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:17:48,695 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 16:17:48,695 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:17:48,699 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;havoc main_#t~nondet12#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;" "assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1;" "call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1);"< [2025-03-04 16:17:48,699 INFO L754 eck$LassoCheckResult]: Loop: "~n := #in~n;~m := #in~m;" "assume !(~n <= 1);" "assume !(2 == ~n);" "assume ~n > 2;" "assume !(~m <= 1);" "call #t~ret10 := multiple_of(~n, ~m);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume !(~n < 0);" "assume 0 == ~m;#res := 0;" "assume true;" >"#99#return;" "assume !(0 == #t~ret10);havoc #t~ret10;" "call #t~ret11 := is_prime_(~n, ~m - 1);"< [2025-03-04 16:17:48,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:17:48,705 INFO L85 PathProgramCache]: Analyzing trace with hash 2892704, now seen corresponding path program 1 times [2025-03-04 16:17:48,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:17:48,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531036066] [2025-03-04 16:17:48,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:17:48,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:17:48,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:17:48,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:17:48,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:48,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:17:48,775 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:17:48,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:17:48,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:17:48,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:48,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:17:48,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:17:48,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:17:48,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1766541863, now seen corresponding path program 1 times [2025-03-04 16:17:48,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:17:48,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264664690] [2025-03-04 16:17:48,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:17:48,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:17:48,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 16:17:48,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 16:17:48,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:48,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:17:48,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:17:48,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:17:48,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264664690] [2025-03-04 16:17:48,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264664690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:17:48,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:17:48,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 16:17:48,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523043922] [2025-03-04 16:17:48,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:17:48,966 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:17:48,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:17:48,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 16:17:48,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 16:17:48,989 INFO L87 Difference]: Start difference. First operand has 51 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 38 states have internal predecessors, (55), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 16:17:49,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:17:49,098 INFO L93 Difference]: Finished difference Result 58 states and 84 transitions. [2025-03-04 16:17:49,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 84 transitions. [2025-03-04 16:17:49,101 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2025-03-04 16:17:49,108 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 41 states and 54 transitions. [2025-03-04 16:17:49,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2025-03-04 16:17:49,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2025-03-04 16:17:49,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 54 transitions. [2025-03-04 16:17:49,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:17:49,113 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 54 transitions. [2025-03-04 16:17:49,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 54 transitions. [2025-03-04 16:17:49,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2025-03-04 16:17:49,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 30 states have internal predecessors, (37), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 16:17:49,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2025-03-04 16:17:49,136 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 51 transitions. [2025-03-04 16:17:49,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 16:17:49,149 INFO L432 stractBuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2025-03-04 16:17:49,149 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 16:17:49,149 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 51 transitions. [2025-03-04 16:17:49,151 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2025-03-04 16:17:49,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:17:49,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:17:49,152 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 16:17:49,152 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:17:49,152 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;havoc main_#t~nondet12#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;" "assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1;" "call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1);"< [2025-03-04 16:17:49,152 INFO L754 eck$LassoCheckResult]: Loop: "~n := #in~n;~m := #in~m;" "assume !(~n <= 1);" "assume !(2 == ~n);" "assume ~n > 2;" "assume !(~m <= 1);" "call #t~ret10 := multiple_of(~n, ~m);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume !(~n < 0);" "assume !(0 == ~m);" "assume 0 == ~n;#res := 1;" "assume true;" >"#99#return;" "assume !(0 == #t~ret10);havoc #t~ret10;" "call #t~ret11 := is_prime_(~n, ~m - 1);"< [2025-03-04 16:17:49,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:17:49,154 INFO L85 PathProgramCache]: Analyzing trace with hash 2892704, now seen corresponding path program 2 times [2025-03-04 16:17:49,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:17:49,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129259030] [2025-03-04 16:17:49,154 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:17:49,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:17:49,160 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:17:49,164 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:17:49,164 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:17:49,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:17:49,164 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:17:49,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:17:49,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:17:49,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:49,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:17:49,173 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:17:49,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:17:49,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1084166589, now seen corresponding path program 1 times [2025-03-04 16:17:49,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:17:49,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403692342] [2025-03-04 16:17:49,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:17:49,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:17:49,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 16:17:49,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 16:17:49,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:49,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:17:49,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:17:49,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:17:49,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403692342] [2025-03-04 16:17:49,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403692342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:17:49,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:17:49,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 16:17:49,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728896770] [2025-03-04 16:17:49,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:17:49,264 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:17:49,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:17:49,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 16:17:49,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 16:17:49,265 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. cyclomatic complexity: 15 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 16:17:49,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:17:49,342 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2025-03-04 16:17:49,342 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 60 transitions. [2025-03-04 16:17:49,343 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2025-03-04 16:17:49,344 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 60 transitions. [2025-03-04 16:17:49,345 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2025-03-04 16:17:49,345 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2025-03-04 16:17:49,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 60 transitions. [2025-03-04 16:17:49,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:17:49,345 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 60 transitions. [2025-03-04 16:17:49,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 60 transitions. [2025-03-04 16:17:49,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2025-03-04 16:17:49,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 32 states have internal predecessors, (38), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 16:17:49,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2025-03-04 16:17:49,348 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 54 transitions. [2025-03-04 16:17:49,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 16:17:49,349 INFO L432 stractBuchiCegarLoop]: Abstraction has 41 states and 54 transitions. [2025-03-04 16:17:49,349 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 16:17:49,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 54 transitions. [2025-03-04 16:17:49,350 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2025-03-04 16:17:49,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:17:49,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:17:49,351 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 16:17:49,351 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:17:49,351 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;havoc main_#t~nondet12#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;" "assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1;" "call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1);"< [2025-03-04 16:17:49,351 INFO L754 eck$LassoCheckResult]: Loop: "~n := #in~n;~m := #in~m;" "assume !(~n <= 1);" "assume !(2 == ~n);" "assume ~n > 2;" "assume !(~m <= 1);" "call #t~ret10 := multiple_of(~n, ~m);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume !(~n < 0);" "assume !(0 == ~m);" "assume !(0 == ~n);" "call #t~ret8 := multiple_of(~n - ~m, ~m);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume !(~n < 0);" "assume !(0 == ~m);" "assume 0 == ~n;#res := 1;" "assume true;" >"#83#return;" "#res := #t~ret8;havoc #t~ret8;" "assume true;" >"#99#return;" "assume !(0 == #t~ret10);havoc #t~ret10;" "call #t~ret11 := is_prime_(~n, ~m - 1);"< [2025-03-04 16:17:49,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:17:49,352 INFO L85 PathProgramCache]: Analyzing trace with hash 2892704, now seen corresponding path program 3 times [2025-03-04 16:17:49,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:17:49,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562883627] [2025-03-04 16:17:49,352 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:17:49,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:17:49,358 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:17:49,363 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:17:49,364 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 16:17:49,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:17:49,364 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:17:49,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:17:49,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:17:49,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:49,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:17:49,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:17:49,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:17:49,370 INFO L85 PathProgramCache]: Analyzing trace with hash 643323679, now seen corresponding path program 1 times [2025-03-04 16:17:49,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:17:49,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42236889] [2025-03-04 16:17:49,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:17:49,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:17:49,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 16:17:49,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 16:17:49,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:49,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:17:49,393 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:17:49,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 16:17:49,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 16:17:49,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:49,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:17:49,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:17:49,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:17:49,408 INFO L85 PathProgramCache]: Analyzing trace with hash 386616766, now seen corresponding path program 1 times [2025-03-04 16:17:49,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:17:49,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515142808] [2025-03-04 16:17:49,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:17:49,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:17:49,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 16:17:49,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 16:17:49,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:49,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:17:49,608 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 16:17:49,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:17:49,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515142808] [2025-03-04 16:17:49,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515142808] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:17:49,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929650875] [2025-03-04 16:17:49,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:17:49,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:17:49,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:49,610 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:17:49,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 16:17:49,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 16:17:49,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 16:17:49,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:49,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:17:49,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 16:17:49,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:17:49,760 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 16:17:49,760 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:17:49,973 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 16:17:49,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929650875] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:17:49,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:17:49,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 11 [2025-03-04 16:17:49,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260373400] [2025-03-04 16:17:49,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:17:50,231 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:17:50,232 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:17:50,232 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:17:50,232 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:17:50,232 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 16:17:50,232 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:50,233 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:17:50,233 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:17:50,233 INFO L132 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration3_Loop [2025-03-04 16:17:50,233 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:17:50,233 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:17:50,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:50,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:50,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:50,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:50,265 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:50,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:50,315 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:17:50,315 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 16:17:50,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:50,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:50,319 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:50,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-04 16:17:50,322 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:17:50,322 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:17:50,338 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:17:50,338 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {is_prime__~m=0} Honda state: {is_prime__~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:17:50,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-04 16:17:50,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:50,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:50,350 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:50,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-04 16:17:50,353 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:17:50,354 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:17:50,367 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:17:50,368 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {is_prime__#t~ret11=0} Honda state: {is_prime__#t~ret11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:17:50,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-04 16:17:50,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:50,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:50,378 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:50,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-04 16:17:50,380 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:17:50,381 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:17:50,392 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:17:50,392 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {is_prime__~n=0} Honda state: {is_prime__~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:17:50,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-03-04 16:17:50,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:50,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:50,400 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:50,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-04 16:17:50,403 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:17:50,403 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:17:50,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-03-04 16:17:50,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:50,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:50,421 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:50,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-04 16:17:50,423 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 16:17:50,423 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:17:50,585 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 16:17:50,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-03-04 16:17:50,591 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:17:50,591 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:17:50,591 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:17:50,591 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:17:50,592 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:17:50,592 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:50,592 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:17:50,592 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:17:50,592 INFO L132 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration3_Loop [2025-03-04 16:17:50,592 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:17:50,592 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:17:50,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:50,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:50,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:50,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:50,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:50,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:50,662 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:17:50,665 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:17:50,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:50,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:50,669 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:50,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-04 16:17:50,672 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:17:50,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:17:50,683 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:17:50,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:17:50,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:17:50,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:17:50,688 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:17:50,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:17:50,691 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:17:50,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-03-04 16:17:50,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:50,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:50,702 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:50,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-04 16:17:50,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:17:50,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:17:50,715 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:17:50,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:17:50,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:17:50,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:17:50,716 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:17:50,716 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:17:50,717 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:17:50,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-04 16:17:50,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:50,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:50,726 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:50,730 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:17:50,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-04 16:17:50,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:17:50,741 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:17:50,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:17:50,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:17:50,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:17:50,742 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:17:50,742 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:17:50,743 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:17:50,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-03-04 16:17:50,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:50,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:50,754 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:50,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-04 16:17:50,757 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:17:50,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:17:50,767 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:17:50,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:17:50,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:17:50,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:17:50,769 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:17:50,769 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:17:50,772 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:17:50,775 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 16:17:50,777 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 16:17:50,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:50,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:50,780 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:50,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-04 16:17:50,783 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:17:50,784 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 16:17:50,784 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:17:50,785 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(is_prime__#in~m) = 1*is_prime__#in~m Supporting invariants [] [2025-03-04 16:17:50,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-03-04 16:17:50,793 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 16:17:50,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:17:50,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:17:50,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:17:50,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:50,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:17:50,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:17:50,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:17:50,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 16:17:50,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 16:17:50,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:50,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:17:50,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 16:17:50,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:17:51,015 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 16:17:51,019 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2025-03-04 16:17:51,020 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 16 Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 16:17:51,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-03-04 16:17:51,555 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 16. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 358 states and 527 transitions. Complement of second has 85 states. [2025-03-04 16:17:51,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 1 stem states 13 non-accepting loop states 1 accepting loop states [2025-03-04 16:17:51,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 16:17:51,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 84 transitions. [2025-03-04 16:17:51,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 84 transitions. Stem has 4 letters. Loop has 24 letters. [2025-03-04 16:17:51,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:17:51,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 84 transitions. Stem has 28 letters. Loop has 24 letters. [2025-03-04 16:17:51,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:17:51,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 84 transitions. Stem has 4 letters. Loop has 48 letters. [2025-03-04 16:17:51,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:17:51,565 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 358 states and 527 transitions. [2025-03-04 16:17:51,574 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 30 [2025-03-04 16:17:51,579 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 358 states to 282 states and 403 transitions. [2025-03-04 16:17:51,579 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 170 [2025-03-04 16:17:51,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 173 [2025-03-04 16:17:51,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 282 states and 403 transitions. [2025-03-04 16:17:51,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:17:51,580 INFO L218 hiAutomatonCegarLoop]: Abstraction has 282 states and 403 transitions. [2025-03-04 16:17:51,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states and 403 transitions. [2025-03-04 16:17:51,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 163. [2025-03-04 16:17:51,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 118 states have (on average 1.3135593220338984) internal successors, (155), 119 states have internal predecessors, (155), 28 states have call successors, (28), 13 states have call predecessors, (28), 17 states have return successors, (37), 30 states have call predecessors, (37), 23 states have call successors, (37) [2025-03-04 16:17:51,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 220 transitions. [2025-03-04 16:17:51,599 INFO L240 hiAutomatonCegarLoop]: Abstraction has 163 states and 220 transitions. [2025-03-04 16:17:51,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:17:51,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 16:17:51,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 16:17:51,600 INFO L87 Difference]: Start difference. First operand 163 states and 220 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 16:17:51,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:17:51,775 INFO L93 Difference]: Finished difference Result 185 states and 251 transitions. [2025-03-04 16:17:51,775 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 185 states and 251 transitions. [2025-03-04 16:17:51,778 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2025-03-04 16:17:51,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 185 states to 117 states and 160 transitions. [2025-03-04 16:17:51,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2025-03-04 16:17:51,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2025-03-04 16:17:51,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 160 transitions. [2025-03-04 16:17:51,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:17:51,781 INFO L218 hiAutomatonCegarLoop]: Abstraction has 117 states and 160 transitions. [2025-03-04 16:17:51,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 160 transitions. [2025-03-04 16:17:51,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 93. [2025-03-04 16:17:51,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 71 states have internal predecessors, (93), 18 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2025-03-04 16:17:51,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 126 transitions. [2025-03-04 16:17:51,786 INFO L240 hiAutomatonCegarLoop]: Abstraction has 93 states and 126 transitions. [2025-03-04 16:17:51,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 16:17:51,788 INFO L432 stractBuchiCegarLoop]: Abstraction has 93 states and 126 transitions. [2025-03-04 16:17:51,788 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 16:17:51,788 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 126 transitions. [2025-03-04 16:17:51,789 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2025-03-04 16:17:51,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:17:51,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:17:51,790 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:17:51,790 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 16:17:51,790 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;havoc main_#t~nondet12#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;" "assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1;" "call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1);"< "~n := #in~n;~m := #in~m;" "assume !(~n <= 1);" "assume !(2 == ~n);" "assume ~n > 2;" "assume !(~m <= 1);" "call #t~ret10 := multiple_of(~n, ~m);"< "~n := #in~n;~m := #in~m;" "assume ~m < 0;" [2025-03-04 16:17:51,790 INFO L754 eck$LassoCheckResult]: Loop: "call #t~ret6 := multiple_of(~n, -~m);"< "~n := #in~n;~m := #in~m;" "assume ~m < 0;" [2025-03-04 16:17:51,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:17:51,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1797482131, now seen corresponding path program 1 times [2025-03-04 16:17:51,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:17:51,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118933484] [2025-03-04 16:17:51,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:17:51,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:17:51,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 16:17:51,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 16:17:51,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:51,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:17:51,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:17:51,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:17:51,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118933484] [2025-03-04 16:17:51,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118933484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:17:51,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:17:51,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 16:17:51,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393152339] [2025-03-04 16:17:51,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:17:51,822 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:17:51,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:17:51,822 INFO L85 PathProgramCache]: Analyzing trace with hash 112979, now seen corresponding path program 1 times [2025-03-04 16:17:51,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:17:51,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101953097] [2025-03-04 16:17:51,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:17:51,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:17:51,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:17:51,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:17:51,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:51,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:17:51,825 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:17:51,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:17:51,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:17:51,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:51,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:17:51,830 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:17:51,885 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:17:51,885 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:17:51,885 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:17:51,886 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:17:51,886 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 16:17:51,886 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:51,886 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:17:51,886 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:17:51,886 INFO L132 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration4_Loop [2025-03-04 16:17:51,886 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:17:51,886 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:17:51,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:51,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:51,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:51,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:51,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:51,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:51,935 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:17:51,935 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 16:17:51,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:51,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:51,938 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:51,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-04 16:17:51,940 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:17:51,940 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:17:51,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-03-04 16:17:51,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:51,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:51,968 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:51,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-04 16:17:51,971 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 16:17:51,972 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:17:52,114 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 16:17:52,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-04 16:17:52,121 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:17:52,121 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:17:52,121 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:17:52,121 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:17:52,121 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:17:52,121 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:52,121 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:17:52,121 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:17:52,121 INFO L132 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration4_Loop [2025-03-04 16:17:52,121 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:17:52,121 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:17:52,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:52,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:52,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:52,131 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:52,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:52,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:52,170 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:17:52,171 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:17:52,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:52,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:52,173 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:52,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-04 16:17:52,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:17:52,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:17:52,186 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:17:52,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:17:52,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:17:52,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:17:52,187 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:17:52,187 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:17:52,188 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:17:52,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-03-04 16:17:52,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:52,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:52,197 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:52,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-04 16:17:52,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:17:52,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:17:52,208 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:17:52,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:17:52,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:17:52,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:17:52,209 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:17:52,209 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:17:52,211 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:17:52,213 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-04 16:17:52,213 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 16:17:52,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:52,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:52,216 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:52,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-04 16:17:52,217 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:17:52,217 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 16:17:52,217 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:17:52,217 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_~m) = 1*multiple_of_~m Supporting invariants [] [2025-03-04 16:17:52,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-04 16:17:52,223 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 16:17:52,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:17:52,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 16:17:52,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 16:17:52,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:52,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:17:52,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 16:17:52,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:17:52,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:17:52,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:17:52,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:52,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:17:52,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 16:17:52,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:17:52,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:17:52,290 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-04 16:17:52,290 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 126 transitions. cyclomatic complexity: 36 Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:17:52,347 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 126 transitions. cyclomatic complexity: 36. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 191 states and 253 transitions. Complement of second has 18 states. [2025-03-04 16:17:52,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-04 16:17:52,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:17:52,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2025-03-04 16:17:52,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 12 letters. Loop has 3 letters. [2025-03-04 16:17:52,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:17:52,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 15 letters. Loop has 3 letters. [2025-03-04 16:17:52,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:17:52,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 12 letters. Loop has 6 letters. [2025-03-04 16:17:52,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:17:52,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 191 states and 253 transitions. [2025-03-04 16:17:52,353 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 42 [2025-03-04 16:17:52,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 191 states to 137 states and 182 transitions. [2025-03-04 16:17:52,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2025-03-04 16:17:52,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2025-03-04 16:17:52,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 182 transitions. [2025-03-04 16:17:52,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:17:52,359 INFO L218 hiAutomatonCegarLoop]: Abstraction has 137 states and 182 transitions. [2025-03-04 16:17:52,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 182 transitions. [2025-03-04 16:17:52,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 108. [2025-03-04 16:17:52,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 84 states have internal predecessors, (106), 23 states have call successors, (25), 10 states have call predecessors, (25), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2025-03-04 16:17:52,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 146 transitions. [2025-03-04 16:17:52,365 INFO L240 hiAutomatonCegarLoop]: Abstraction has 108 states and 146 transitions. [2025-03-04 16:17:52,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:17:52,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 16:17:52,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 16:17:52,366 INFO L87 Difference]: Start difference. First operand 108 states and 146 transitions. Second operand has 5 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:17:52,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:17:52,395 INFO L93 Difference]: Finished difference Result 98 states and 128 transitions. [2025-03-04 16:17:52,396 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 128 transitions. [2025-03-04 16:17:52,397 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2025-03-04 16:17:52,398 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 98 states and 128 transitions. [2025-03-04 16:17:52,398 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2025-03-04 16:17:52,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 [2025-03-04 16:17:52,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 128 transitions. [2025-03-04 16:17:52,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:17:52,403 INFO L218 hiAutomatonCegarLoop]: Abstraction has 98 states and 128 transitions. [2025-03-04 16:17:52,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 128 transitions. [2025-03-04 16:17:52,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 92. [2025-03-04 16:17:52,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 67 states have (on average 1.328358208955224) internal successors, (89), 70 states have internal predecessors, (89), 17 states have call successors, (17), 8 states have call predecessors, (17), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2025-03-04 16:17:52,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 121 transitions. [2025-03-04 16:17:52,406 INFO L240 hiAutomatonCegarLoop]: Abstraction has 92 states and 121 transitions. [2025-03-04 16:17:52,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 16:17:52,408 INFO L432 stractBuchiCegarLoop]: Abstraction has 92 states and 121 transitions. [2025-03-04 16:17:52,410 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 16:17:52,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 121 transitions. [2025-03-04 16:17:52,411 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2025-03-04 16:17:52,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:17:52,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:17:52,411 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:17:52,411 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 16:17:52,412 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;havoc main_#t~nondet12#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;" "assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1;" "call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1);"< "~n := #in~n;~m := #in~m;" "assume ~n <= 1;#res := 0;" "assume true;" >"#95#return;" "is_prime_#res#1 := is_prime_#t~ret9#1;havoc is_prime_#t~ret9#1;" "main_#t~ret13#1 := is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;havoc is_prime_#in~n#1;assume { :end_inline_is_prime } true;main_~result~0#1 := main_#t~ret13#1;havoc main_#t~ret13#1;havoc main_#t~nondet14#1;main_~f1~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;" "assume !(main_~f1~0#1 < 1 || main_~f1~0#1 > 46340);havoc main_#t~nondet15#1;main_~f2~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;" "assume !(main_~f2~0#1 < 1 || main_~f2~0#1 > 46340);main_#t~short17#1 := 1 == main_~result~0#1;" "assume main_#t~short17#1;" "call main_#t~ret16#1 := mult(main_~f1~0#1, main_~f2~0#1);"< [2025-03-04 16:17:52,412 INFO L754 eck$LassoCheckResult]: Loop: "~n := #in~n;~m := #in~m;" "assume ~m < 0;" "call #t~ret4 := mult(~n, -~m);"< [2025-03-04 16:17:52,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:17:52,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1922765015, now seen corresponding path program 1 times [2025-03-04 16:17:52,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:17:52,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372502139] [2025-03-04 16:17:52,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:17:52,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:17:52,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 16:17:52,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 16:17:52,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:52,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:17:52,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-04 16:17:52,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:17:52,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:17:52,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372502139] [2025-03-04 16:17:52,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372502139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:17:52,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:17:52,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 16:17:52,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226720551] [2025-03-04 16:17:52,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:17:52,494 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:17:52,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:17:52,495 INFO L85 PathProgramCache]: Analyzing trace with hash 60571, now seen corresponding path program 1 times [2025-03-04 16:17:52,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:17:52,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490566930] [2025-03-04 16:17:52,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:17:52,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:17:52,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:17:52,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:17:52,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:52,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:17:52,500 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:17:52,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:17:52,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:17:52,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:52,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:17:52,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:17:52,535 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:17:52,536 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:17:52,536 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:17:52,536 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:17:52,536 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 16:17:52,536 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:52,536 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:17:52,536 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:17:52,536 INFO L132 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration5_Loop [2025-03-04 16:17:52,536 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:17:52,536 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:17:52,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:52,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:52,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:52,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:52,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:52,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:52,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:52,589 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:17:52,590 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 16:17:52,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:52,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:52,592 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:52,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-04 16:17:52,595 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:17:52,595 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:17:52,608 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:17:52,608 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#res=0} Honda state: {mult_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:17:52,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-03-04 16:17:52,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:52,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:52,618 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:52,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-04 16:17:52,623 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:17:52,623 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:17:52,634 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:17:52,635 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~m=0} Honda state: {mult_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:17:52,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-03-04 16:17:52,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:52,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:52,644 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:52,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-04 16:17:52,647 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:17:52,647 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:17:52,657 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:17:52,657 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret5=0} Honda state: {mult_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:17:52,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-03-04 16:17:52,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:52,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:52,667 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:52,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-04 16:17:52,670 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:17:52,670 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:17:52,681 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:17:52,681 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~n=0} Honda state: {mult_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:17:52,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-03-04 16:17:52,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:52,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:52,689 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:52,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-04 16:17:52,692 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:17:52,692 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:17:52,706 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:17:52,706 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret4=0} Honda state: {mult_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:17:52,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-03-04 16:17:52,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:52,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:52,715 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:52,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-04 16:17:52,718 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:17:52,718 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:17:52,729 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:17:52,729 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#in~n=0} Honda state: {mult_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:17:52,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-03-04 16:17:52,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:52,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:52,741 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:52,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-04 16:17:52,742 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:17:52,742 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:17:52,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-03-04 16:17:52,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:52,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:52,761 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:52,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-04 16:17:52,764 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 16:17:52,764 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:17:52,803 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 16:17:52,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-03-04 16:17:52,808 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:17:52,808 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:17:52,808 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:17:52,808 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:17:52,808 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:17:52,808 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:52,808 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:17:52,808 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:17:52,808 INFO L132 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration5_Loop [2025-03-04 16:17:52,808 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:17:52,809 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:17:52,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:52,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:52,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:52,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:52,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:52,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:52,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:52,849 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:17:52,849 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:17:52,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:52,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:52,851 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:52,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-04 16:17:52,853 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:17:52,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:17:52,863 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:17:52,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:17:52,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:17:52,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:17:52,864 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:17:52,864 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:17:52,865 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:17:52,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-03-04 16:17:52,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:52,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:52,873 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:52,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-04 16:17:52,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:17:52,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:17:52,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:17:52,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:17:52,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:17:52,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:17:52,887 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:17:52,887 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:17:52,890 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:17:52,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-03-04 16:17:52,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:52,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:52,898 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:52,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-04 16:17:52,901 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:17:52,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:17:52,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:17:52,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:17:52,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:17:52,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:17:52,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:17:52,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:17:52,913 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:17:52,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-03-04 16:17:52,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:52,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:52,920 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:52,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-04 16:17:52,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:17:52,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:17:52,931 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:17:52,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:17:52,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:17:52,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:17:52,932 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:17:52,932 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:17:52,933 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:17:52,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-03-04 16:17:52,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:52,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:52,943 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:52,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-03-04 16:17:52,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:17:52,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:17:52,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:17:52,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:17:52,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:17:52,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:17:52,958 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:17:52,958 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:17:52,960 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:17:52,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-03-04 16:17:52,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:52,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:52,968 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:52,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-04 16:17:52,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:17:52,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:17:52,980 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:17:52,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:17:52,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:17:52,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:17:52,980 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:17:52,980 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:17:52,981 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:17:52,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-04 16:17:52,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:52,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:52,990 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:52,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-04 16:17:52,991 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:17:53,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:17:53,001 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:17:53,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:17:53,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:17:53,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:17:53,002 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:17:53,002 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:17:53,003 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:17:53,005 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-04 16:17:53,005 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 16:17:53,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:53,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:53,007 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:53,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-03-04 16:17:53,009 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:17:53,009 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 16:17:53,009 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:17:53,009 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_#in~m) = -1*mult_#in~m Supporting invariants [] [2025-03-04 16:17:53,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-03-04 16:17:53,015 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 16:17:53,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:17:53,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 16:17:53,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 16:17:53,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:53,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:17:53,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 16:17:53,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:17:53,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:17:53,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:17:53,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:53,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:17:53,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 16:17:53,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:17:53,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:17:53,107 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2025-03-04 16:17:53,107 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 121 transitions. cyclomatic complexity: 32 Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 16:17:53,177 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 121 transitions. cyclomatic complexity: 32. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 114 states and 145 transitions. Complement of second has 14 states. [2025-03-04 16:17:53,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 16:17:53,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 16:17:53,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2025-03-04 16:17:53,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 14 letters. Loop has 3 letters. [2025-03-04 16:17:53,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:17:53,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 17 letters. Loop has 3 letters. [2025-03-04 16:17:53,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:17:53,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 14 letters. Loop has 6 letters. [2025-03-04 16:17:53,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:17:53,178 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 145 transitions. [2025-03-04 16:17:53,179 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2025-03-04 16:17:53,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 106 states and 137 transitions. [2025-03-04 16:17:53,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 99 [2025-03-04 16:17:53,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2025-03-04 16:17:53,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 137 transitions. [2025-03-04 16:17:53,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:17:53,183 INFO L218 hiAutomatonCegarLoop]: Abstraction has 106 states and 137 transitions. [2025-03-04 16:17:53,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 137 transitions. [2025-03-04 16:17:53,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 97. [2025-03-04 16:17:53,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 73 states have internal predecessors, (95), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2025-03-04 16:17:53,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 128 transitions. [2025-03-04 16:17:53,189 INFO L240 hiAutomatonCegarLoop]: Abstraction has 97 states and 128 transitions. [2025-03-04 16:17:53,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:17:53,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 16:17:53,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 16:17:53,189 INFO L87 Difference]: Start difference. First operand 97 states and 128 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 16:17:53,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:17:53,210 INFO L93 Difference]: Finished difference Result 108 states and 139 transitions. [2025-03-04 16:17:53,211 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 139 transitions. [2025-03-04 16:17:53,211 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2025-03-04 16:17:53,213 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 101 states and 131 transitions. [2025-03-04 16:17:53,213 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2025-03-04 16:17:53,213 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 [2025-03-04 16:17:53,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 131 transitions. [2025-03-04 16:17:53,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:17:53,213 INFO L218 hiAutomatonCegarLoop]: Abstraction has 101 states and 131 transitions. [2025-03-04 16:17:53,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 131 transitions. [2025-03-04 16:17:53,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2025-03-04 16:17:53,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 73 states have internal predecessors, (93), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2025-03-04 16:17:53,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 126 transitions. [2025-03-04 16:17:53,217 INFO L240 hiAutomatonCegarLoop]: Abstraction has 97 states and 126 transitions. [2025-03-04 16:17:53,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 16:17:53,219 INFO L432 stractBuchiCegarLoop]: Abstraction has 97 states and 126 transitions. [2025-03-04 16:17:53,219 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 16:17:53,219 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 126 transitions. [2025-03-04 16:17:53,220 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2025-03-04 16:17:53,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:17:53,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:17:53,220 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:17:53,220 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-04 16:17:53,220 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;havoc main_#t~nondet12#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;" "assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1;" "call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1);"< "~n := #in~n;~m := #in~m;" "assume !(~n <= 1);" "assume !(2 == ~n);" "assume ~n > 2;" "assume !(~m <= 1);" "call #t~ret10 := multiple_of(~n, ~m);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume ~n < 0;" "call #t~ret7 := multiple_of(-~n, ~m);"< [2025-03-04 16:17:53,220 INFO L754 eck$LassoCheckResult]: Loop: "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume ~n < 0;" "call #t~ret7 := multiple_of(-~n, ~m);"< [2025-03-04 16:17:53,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:17:53,220 INFO L85 PathProgramCache]: Analyzing trace with hash 803476254, now seen corresponding path program 1 times [2025-03-04 16:17:53,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:17:53,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615900887] [2025-03-04 16:17:53,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:17:53,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:17:53,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 16:17:53,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 16:17:53,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:53,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:17:53,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:17:53,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:17:53,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615900887] [2025-03-04 16:17:53,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615900887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:17:53,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:17:53,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 16:17:53,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251462914] [2025-03-04 16:17:53,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:17:53,274 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:17:53,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:17:53,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1445738, now seen corresponding path program 1 times [2025-03-04 16:17:53,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:17:53,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015164160] [2025-03-04 16:17:53,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:17:53,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:17:53,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:17:53,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:17:53,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:53,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:17:53,277 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:17:53,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:17:53,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:17:53,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:53,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:17:53,278 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:17:53,314 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:17:53,314 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:17:53,314 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:17:53,314 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:17:53,314 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 16:17:53,314 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:53,314 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:17:53,314 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:17:53,314 INFO L132 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration6_Loop [2025-03-04 16:17:53,314 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:17:53,314 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:17:53,314 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:53,319 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:53,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:53,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:53,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:53,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:53,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:53,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:53,356 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:17:53,356 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 16:17:53,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:53,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:53,358 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:53,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-03-04 16:17:53,360 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:17:53,360 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:17:53,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-03-04 16:17:53,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:53,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:53,379 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:53,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-03-04 16:17:53,381 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 16:17:53,381 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:17:53,420 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 16:17:53,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-03-04 16:17:53,425 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:17:53,425 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:17:53,425 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:17:53,425 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:17:53,425 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:17:53,425 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:53,425 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:17:53,425 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:17:53,425 INFO L132 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration6_Loop [2025-03-04 16:17:53,425 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:17:53,425 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:17:53,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:53,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:53,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:53,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:53,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:53,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:53,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:53,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:53,476 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:17:53,476 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:17:53,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:53,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:53,479 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:53,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-03-04 16:17:53,481 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:17:53,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:17:53,491 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:17:53,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:17:53,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:17:53,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:17:53,493 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:17:53,493 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:17:53,494 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:17:53,496 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-04 16:17:53,496 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 16:17:53,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:53,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:53,498 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:53,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-03-04 16:17:53,501 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:17:53,501 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 16:17:53,501 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:17:53,501 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_#in~n) = -1*multiple_of_#in~n Supporting invariants [] [2025-03-04 16:17:53,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-03-04 16:17:53,508 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 16:17:53,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:17:53,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 16:17:53,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 16:17:53,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:53,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:17:53,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 16:17:53,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:17:53,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-03-04 16:17:53,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-03-04 16:17:53,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:17:53,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:17:53,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:53,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:17:53,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 16:17:53,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:17:53,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:17:53,594 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-04 16:17:53,594 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 97 states and 126 transitions. cyclomatic complexity: 33 Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:17:53,637 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 97 states and 126 transitions. cyclomatic complexity: 33. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 200 states and 269 transitions. Complement of second has 17 states. [2025-03-04 16:17:53,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-04 16:17:53,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:17:53,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2025-03-04 16:17:53,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 14 letters. Loop has 4 letters. [2025-03-04 16:17:53,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:17:53,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 18 letters. Loop has 4 letters. [2025-03-04 16:17:53,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:17:53,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 14 letters. Loop has 8 letters. [2025-03-04 16:17:53,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:17:53,639 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 200 states and 269 transitions. [2025-03-04 16:17:53,642 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 48 [2025-03-04 16:17:53,645 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 200 states to 188 states and 257 transitions. [2025-03-04 16:17:53,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 173 [2025-03-04 16:17:53,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 175 [2025-03-04 16:17:53,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 188 states and 257 transitions. [2025-03-04 16:17:53,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:17:53,645 INFO L218 hiAutomatonCegarLoop]: Abstraction has 188 states and 257 transitions. [2025-03-04 16:17:53,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states and 257 transitions. [2025-03-04 16:17:53,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 163. [2025-03-04 16:17:53,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 125 states have internal predecessors, (158), 28 states have call successors, (28), 16 states have call predecessors, (28), 16 states have return successors, (37), 21 states have call predecessors, (37), 22 states have call successors, (37) [2025-03-04 16:17:53,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 223 transitions. [2025-03-04 16:17:53,658 INFO L240 hiAutomatonCegarLoop]: Abstraction has 163 states and 223 transitions. [2025-03-04 16:17:53,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:17:53,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 16:17:53,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 16:17:53,659 INFO L87 Difference]: Start difference. First operand 163 states and 223 transitions. Second operand has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:17:53,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:17:53,724 INFO L93 Difference]: Finished difference Result 171 states and 230 transitions. [2025-03-04 16:17:53,724 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 171 states and 230 transitions. [2025-03-04 16:17:53,726 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 42 [2025-03-04 16:17:53,727 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 171 states to 171 states and 230 transitions. [2025-03-04 16:17:53,728 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 164 [2025-03-04 16:17:53,728 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 164 [2025-03-04 16:17:53,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 230 transitions. [2025-03-04 16:17:53,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:17:53,728 INFO L218 hiAutomatonCegarLoop]: Abstraction has 171 states and 230 transitions. [2025-03-04 16:17:53,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 230 transitions. [2025-03-04 16:17:53,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 165. [2025-03-04 16:17:53,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 121 states have (on average 1.2975206611570247) internal successors, (157), 127 states have internal predecessors, (157), 26 states have call successors, (26), 16 states have call predecessors, (26), 18 states have return successors, (40), 21 states have call predecessors, (40), 22 states have call successors, (40) [2025-03-04 16:17:53,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 223 transitions. [2025-03-04 16:17:53,733 INFO L240 hiAutomatonCegarLoop]: Abstraction has 165 states and 223 transitions. [2025-03-04 16:17:53,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 16:17:53,735 INFO L432 stractBuchiCegarLoop]: Abstraction has 165 states and 223 transitions. [2025-03-04 16:17:53,735 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-04 16:17:53,735 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 165 states and 223 transitions. [2025-03-04 16:17:53,736 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 42 [2025-03-04 16:17:53,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:17:53,736 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:17:53,736 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:17:53,736 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-04 16:17:53,737 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;havoc main_#t~nondet12#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;" "assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1;" "call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1);"< "~n := #in~n;~m := #in~m;" "assume !(~n <= 1);" "assume !(2 == ~n);" "assume ~n > 2;" "assume !(~m <= 1);" "call #t~ret10 := multiple_of(~n, ~m);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume !(~n < 0);" "assume !(0 == ~m);" "assume !(0 == ~n);" "call #t~ret8 := multiple_of(~n - ~m, ~m);"< [2025-03-04 16:17:53,737 INFO L754 eck$LassoCheckResult]: Loop: "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume !(~n < 0);" "assume !(0 == ~m);" "assume !(0 == ~n);" "call #t~ret8 := multiple_of(~n - ~m, ~m);"< [2025-03-04 16:17:53,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:17:53,737 INFO L85 PathProgramCache]: Analyzing trace with hash -953478147, now seen corresponding path program 1 times [2025-03-04 16:17:53,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:17:53,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624666602] [2025-03-04 16:17:53,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:17:53,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:17:53,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 16:17:53,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 16:17:53,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:53,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:17:53,742 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:17:53,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 16:17:53,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 16:17:53,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:53,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:17:53,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:17:53,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:17:53,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1389309257, now seen corresponding path program 1 times [2025-03-04 16:17:53,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:17:53,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551090325] [2025-03-04 16:17:53,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:17:53,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:17:53,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 16:17:53,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 16:17:53,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:53,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:17:53,752 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:17:53,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 16:17:53,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 16:17:53,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:53,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:17:53,753 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:17:53,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:17:53,755 INFO L85 PathProgramCache]: Analyzing trace with hash -155036603, now seen corresponding path program 2 times [2025-03-04 16:17:53,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:17:53,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023386648] [2025-03-04 16:17:53,755 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:17:53,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:17:53,758 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 16:17:53,767 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 16:17:53,767 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:17:53,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:17:53,768 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:17:53,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 16:17:53,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 16:17:53,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:53,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:17:53,773 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:17:53,826 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:17:53,826 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:17:53,826 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:17:53,826 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:17:53,826 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 16:17:53,826 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:53,826 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:17:53,826 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:17:53,826 INFO L132 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration7_Loop [2025-03-04 16:17:53,826 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:17:53,826 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:17:53,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:53,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:53,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:53,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:53,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:53,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:53,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:53,887 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:17:53,887 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 16:17:53,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:53,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:53,889 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:53,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-03-04 16:17:53,891 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:17:53,891 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:17:53,902 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:17:53,902 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#res=0} Honda state: {multiple_of_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:17:53,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-03-04 16:17:53,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:53,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:53,910 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:53,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-03-04 16:17:53,913 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:17:53,913 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:17:53,924 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:17:53,924 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_~n=0} Honda state: {multiple_of_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:17:53,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-03-04 16:17:53,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:53,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:53,932 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:53,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-03-04 16:17:53,935 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:17:53,935 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:17:53,946 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:17:53,946 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_~m=0} Honda state: {multiple_of_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:17:53,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-03-04 16:17:53,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:53,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:53,954 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:53,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-03-04 16:17:53,956 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:17:53,956 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:17:53,966 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:17:53,966 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#t~ret8=0} Honda state: {multiple_of_#t~ret8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:17:53,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-03-04 16:17:53,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:53,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:53,973 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:53,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-03-04 16:17:53,974 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:17:53,974 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:17:53,985 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:17:53,985 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#t~ret7=0} Honda state: {multiple_of_#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:17:53,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-03-04 16:17:53,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:53,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:53,993 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:53,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-03-04 16:17:53,996 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:17:53,996 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:17:54,007 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:17:54,007 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#t~ret6=0} Honda state: {multiple_of_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:17:54,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-03-04 16:17:54,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:54,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:54,014 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:54,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-03-04 16:17:54,016 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:17:54,016 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:17:54,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-03-04 16:17:54,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:54,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:54,034 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:54,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-03-04 16:17:54,035 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 16:17:54,035 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:17:54,088 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 16:17:54,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-03-04 16:17:54,093 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:17:54,093 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:17:54,093 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:17:54,093 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:17:54,093 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:17:54,093 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:54,093 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:17:54,093 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:17:54,093 INFO L132 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration7_Loop [2025-03-04 16:17:54,093 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:17:54,093 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:17:54,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:54,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:54,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:54,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:54,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:54,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:54,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:54,165 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:17:54,165 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:17:54,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:54,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:54,167 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:54,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-03-04 16:17:54,169 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:17:54,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:17:54,179 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:17:54,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:17:54,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:17:54,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:17:54,180 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:17:54,180 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:17:54,181 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:17:54,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2025-03-04 16:17:54,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:54,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:54,189 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:54,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-03-04 16:17:54,191 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:17:54,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:17:54,201 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:17:54,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:17:54,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:17:54,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:17:54,202 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:17:54,202 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:17:54,205 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:17:54,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2025-03-04 16:17:54,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:54,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:54,213 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:54,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-03-04 16:17:54,216 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:17:54,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:17:54,226 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:17:54,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:17:54,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:17:54,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:17:54,227 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:17:54,227 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:17:54,231 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:17:54,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-03-04 16:17:54,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:54,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:54,239 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:54,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-03-04 16:17:54,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:17:54,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:17:54,253 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:17:54,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:17:54,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:17:54,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:17:54,254 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:17:54,254 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:17:54,255 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:17:54,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2025-03-04 16:17:54,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:54,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:54,263 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:54,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-03-04 16:17:54,266 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:17:54,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:17:54,276 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:17:54,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:17:54,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:17:54,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:17:54,277 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:17:54,277 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:17:54,278 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:17:54,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-03-04 16:17:54,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:54,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:54,285 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:54,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-03-04 16:17:54,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:17:54,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:17:54,297 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:17:54,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:17:54,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:17:54,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:17:54,299 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:17:54,299 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:17:54,301 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:17:54,303 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 16:17:54,303 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 16:17:54,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:54,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:54,305 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:54,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-03-04 16:17:54,308 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:17:54,308 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 16:17:54,308 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:17:54,308 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_#in~n) = 1*multiple_of_#in~n Supporting invariants [] [2025-03-04 16:17:54,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2025-03-04 16:17:54,314 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 16:17:54,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:17:54,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 16:17:54,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 16:17:54,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:54,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:17:54,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 16:17:54,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:17:54,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 16:17:54,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 16:17:54,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:54,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:17:54,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 16:17:54,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:17:54,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:17:54,427 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2025-03-04 16:17:54,427 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 165 states and 223 transitions. cyclomatic complexity: 65 Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:17:54,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2025-03-04 16:17:54,536 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 165 states and 223 transitions. cyclomatic complexity: 65. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 218 states and 293 transitions. Complement of second has 29 states. [2025-03-04 16:17:54,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2025-03-04 16:17:54,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:17:54,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2025-03-04 16:17:54,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 16 letters. Loop has 6 letters. [2025-03-04 16:17:54,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:17:54,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 22 letters. Loop has 6 letters. [2025-03-04 16:17:54,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:17:54,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 16 letters. Loop has 12 letters. [2025-03-04 16:17:54,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:17:54,543 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 218 states and 293 transitions. [2025-03-04 16:17:54,545 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 48 [2025-03-04 16:17:54,546 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 218 states to 206 states and 279 transitions. [2025-03-04 16:17:54,546 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 183 [2025-03-04 16:17:54,547 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 185 [2025-03-04 16:17:54,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 206 states and 279 transitions. [2025-03-04 16:17:54,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:17:54,547 INFO L218 hiAutomatonCegarLoop]: Abstraction has 206 states and 279 transitions. [2025-03-04 16:17:54,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states and 279 transitions. [2025-03-04 16:17:54,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 181. [2025-03-04 16:17:54,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 134 states have (on average 1.291044776119403) internal successors, (173), 141 states have internal predecessors, (173), 28 states have call successors, (28), 18 states have call predecessors, (28), 19 states have return successors, (44), 21 states have call predecessors, (44), 23 states have call successors, (44) [2025-03-04 16:17:54,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 245 transitions. [2025-03-04 16:17:54,551 INFO L240 hiAutomatonCegarLoop]: Abstraction has 181 states and 245 transitions. [2025-03-04 16:17:54,551 INFO L432 stractBuchiCegarLoop]: Abstraction has 181 states and 245 transitions. [2025-03-04 16:17:54,551 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-04 16:17:54,551 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 181 states and 245 transitions. [2025-03-04 16:17:54,552 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 42 [2025-03-04 16:17:54,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:17:54,552 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:17:54,553 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:17:54,553 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-04 16:17:54,553 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;havoc main_#t~nondet12#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;" "assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1;" "call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1);"< "~n := #in~n;~m := #in~m;" "assume !(~n <= 1);" "assume 2 == ~n;#res := 1;" "assume true;" >"#95#return;" "is_prime_#res#1 := is_prime_#t~ret9#1;havoc is_prime_#t~ret9#1;" "main_#t~ret13#1 := is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;havoc is_prime_#in~n#1;assume { :end_inline_is_prime } true;main_~result~0#1 := main_#t~ret13#1;havoc main_#t~ret13#1;havoc main_#t~nondet14#1;main_~f1~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;" "assume !(main_~f1~0#1 < 1 || main_~f1~0#1 > 46340);havoc main_#t~nondet15#1;main_~f2~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;" "assume !(main_~f2~0#1 < 1 || main_~f2~0#1 > 46340);main_#t~short17#1 := 1 == main_~result~0#1;" "assume main_#t~short17#1;" "call main_#t~ret16#1 := mult(main_~f1~0#1, main_~f2~0#1);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" [2025-03-04 16:17:54,553 INFO L754 eck$LassoCheckResult]: Loop: "assume !(0 == ~m);" "assume !(1 == ~m);" "call #t~ret5 := mult(~n, ~m - 1);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" [2025-03-04 16:17:54,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:17:54,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1709161179, now seen corresponding path program 1 times [2025-03-04 16:17:54,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:17:54,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980697893] [2025-03-04 16:17:54,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:17:54,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:17:54,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 16:17:54,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 16:17:54,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:54,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:17:54,559 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:17:54,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 16:17:54,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 16:17:54,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:54,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:17:54,566 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:17:54,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:17:54,567 INFO L85 PathProgramCache]: Analyzing trace with hash 52487928, now seen corresponding path program 1 times [2025-03-04 16:17:54,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:17:54,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138315961] [2025-03-04 16:17:54,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:17:54,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:17:54,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:17:54,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:17:54,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:54,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:17:54,570 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:17:54,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:17:54,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:17:54,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:54,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:17:54,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:17:54,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:17:54,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1194182572, now seen corresponding path program 1 times [2025-03-04 16:17:54,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:17:54,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568476516] [2025-03-04 16:17:54,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:17:54,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:17:54,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 16:17:54,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 16:17:54,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:54,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:17:54,582 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:17:54,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 16:17:54,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 16:17:54,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:54,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:17:54,592 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:17:54,656 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:17:54,657 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:17:54,657 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:17:54,657 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:17:54,657 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 16:17:54,657 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:54,657 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:17:54,657 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:17:54,657 INFO L132 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration8_Loop [2025-03-04 16:17:54,657 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:17:54,657 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:17:54,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:54,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:54,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:54,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:54,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:54,714 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:17:54,714 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 16:17:54,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:54,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:54,716 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:54,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-03-04 16:17:54,717 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:17:54,717 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:17:54,728 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:17:54,728 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#res=0} Honda state: {mult_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:17:54,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-03-04 16:17:54,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:54,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:54,735 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:54,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-03-04 16:17:54,737 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:17:54,737 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:17:54,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-03-04 16:17:54,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:54,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:54,764 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:54,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-03-04 16:17:54,766 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 16:17:54,766 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:17:54,854 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 16:17:54,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-03-04 16:17:54,859 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:17:54,859 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:17:54,859 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:17:54,859 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:17:54,859 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:17:54,859 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:54,859 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:17:54,859 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:17:54,859 INFO L132 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration8_Loop [2025-03-04 16:17:54,859 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:17:54,859 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:17:54,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:54,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:54,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:54,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:54,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:54,911 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:17:54,911 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:17:54,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:54,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:54,913 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:54,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-03-04 16:17:54,916 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:17:54,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:17:54,926 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:17:54,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:17:54,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:17:54,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:17:54,926 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:17:54,926 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:17:54,928 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:17:54,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-03-04 16:17:54,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:54,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:54,936 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:54,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-03-04 16:17:54,939 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:17:54,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:17:54,950 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:17:54,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:17:54,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:17:54,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:17:54,951 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:17:54,951 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:17:54,953 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:17:54,956 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 16:17:54,956 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 16:17:54,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:54,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:54,958 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:54,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-03-04 16:17:54,961 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:17:54,961 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 16:17:54,961 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:17:54,961 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_~m) = 1*mult_~m Supporting invariants [] [2025-03-04 16:17:54,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-03-04 16:17:54,971 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 16:17:54,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:17:54,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 16:17:54,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 16:17:54,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:54,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:17:55,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 16:17:55,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:17:55,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:17:55,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:17:55,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:55,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:17:55,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 16:17:55,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:17:55,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:17:55,142 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2025-03-04 16:17:55,143 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 181 states and 245 transitions. cyclomatic complexity: 72 Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 16:17:55,296 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 181 states and 245 transitions. cyclomatic complexity: 72. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 205 states and 272 transitions. Complement of second has 25 states. [2025-03-04 16:17:55,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2025-03-04 16:17:55,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 16:17:55,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2025-03-04 16:17:55,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 52 transitions. Stem has 17 letters. Loop has 5 letters. [2025-03-04 16:17:55,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:17:55,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 52 transitions. Stem has 22 letters. Loop has 5 letters. [2025-03-04 16:17:55,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:17:55,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 52 transitions. Stem has 17 letters. Loop has 10 letters. [2025-03-04 16:17:55,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:17:55,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 205 states and 272 transitions. [2025-03-04 16:17:55,302 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 42 [2025-03-04 16:17:55,303 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 205 states to 204 states and 271 transitions. [2025-03-04 16:17:55,303 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 177 [2025-03-04 16:17:55,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 180 [2025-03-04 16:17:55,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 204 states and 271 transitions. [2025-03-04 16:17:55,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:17:55,304 INFO L218 hiAutomatonCegarLoop]: Abstraction has 204 states and 271 transitions. [2025-03-04 16:17:55,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states and 271 transitions. [2025-03-04 16:17:55,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 191. [2025-03-04 16:17:55,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 142 states have (on average 1.2887323943661972) internal successors, (183), 149 states have internal predecessors, (183), 30 states have call successors, (30), 20 states have call predecessors, (30), 19 states have return successors, (44), 21 states have call predecessors, (44), 23 states have call successors, (44) [2025-03-04 16:17:55,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 257 transitions. [2025-03-04 16:17:55,308 INFO L240 hiAutomatonCegarLoop]: Abstraction has 191 states and 257 transitions. [2025-03-04 16:17:55,308 INFO L432 stractBuchiCegarLoop]: Abstraction has 191 states and 257 transitions. [2025-03-04 16:17:55,309 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-04 16:17:55,309 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 191 states and 257 transitions. [2025-03-04 16:17:55,310 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 42 [2025-03-04 16:17:55,310 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:17:55,310 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:17:55,310 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:17:55,311 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 16:17:55,311 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;havoc main_#t~nondet12#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;" "assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1;" "call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1);"< "~n := #in~n;~m := #in~m;" "assume !(~n <= 1);" "assume 2 == ~n;#res := 1;" "assume true;" >"#95#return;" "is_prime_#res#1 := is_prime_#t~ret9#1;havoc is_prime_#t~ret9#1;" "main_#t~ret13#1 := is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;havoc is_prime_#in~n#1;assume { :end_inline_is_prime } true;main_~result~0#1 := main_#t~ret13#1;havoc main_#t~ret13#1;havoc main_#t~nondet14#1;main_~f1~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;" "assume !(main_~f1~0#1 < 1 || main_~f1~0#1 > 46340);havoc main_#t~nondet15#1;main_~f2~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;" "assume !(main_~f2~0#1 < 1 || main_~f2~0#1 > 46340);main_#t~short17#1 := 1 == main_~result~0#1;" "assume main_#t~short17#1;" "call main_#t~ret16#1 := mult(main_~f1~0#1, main_~f2~0#1);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume !(0 == ~m);" "assume !(1 == ~m);" "call #t~ret5 := mult(~n, ~m - 1);"< "~n := #in~n;~m := #in~m;" "assume ~m < 0;" [2025-03-04 16:17:55,311 INFO L754 eck$LassoCheckResult]: Loop: "call #t~ret4 := mult(~n, -~m);"< "~n := #in~n;~m := #in~m;" "assume ~m < 0;" [2025-03-04 16:17:55,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:17:55,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1194182573, now seen corresponding path program 1 times [2025-03-04 16:17:55,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:17:55,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640885079] [2025-03-04 16:17:55,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:17:55,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:17:55,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 16:17:55,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 16:17:55,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:55,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:17:55,350 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Exception during sending of exit command (exit): Broken pipe [2025-03-04 16:17:55,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-03-04 16:17:55,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:17:55,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:17:55,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640885079] [2025-03-04 16:17:55,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640885079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:17:55,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:17:55,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 16:17:55,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134852443] [2025-03-04 16:17:55,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:17:55,364 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:17:55,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:17:55,364 INFO L85 PathProgramCache]: Analyzing trace with hash 117271, now seen corresponding path program 2 times [2025-03-04 16:17:55,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:17:55,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319806846] [2025-03-04 16:17:55,365 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:17:55,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:17:55,366 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:17:55,367 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:17:55,367 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:17:55,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:17:55,367 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:17:55,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:17:55,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:17:55,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:55,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:17:55,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:17:55,419 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:17:55,419 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:17:55,419 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:17:55,419 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:17:55,419 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 16:17:55,419 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:55,419 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:17:55,419 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:17:55,419 INFO L132 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration9_Loop [2025-03-04 16:17:55,419 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:17:55,419 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:17:55,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:55,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:55,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:55,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:55,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:55,460 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:17:55,460 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 16:17:55,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:55,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:55,464 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:55,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-03-04 16:17:55,474 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:17:55,474 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:17:55,494 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:17:55,495 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~n=-6, mult_#in~n=-6} Honda state: {mult_~n=-6, mult_#in~n=-6} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:17:55,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-03-04 16:17:55,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:55,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:55,503 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:55,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-03-04 16:17:55,507 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:17:55,507 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:17:55,518 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:17:55,518 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret4=0} Honda state: {mult_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:17:55,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2025-03-04 16:17:55,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:55,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:55,526 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:55,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-03-04 16:17:55,528 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:17:55,529 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:17:55,539 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:17:55,540 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret5=0} Honda state: {mult_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:17:55,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2025-03-04 16:17:55,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:55,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:55,548 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:55,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-03-04 16:17:55,550 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:17:55,550 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:17:55,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-03-04 16:17:55,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:55,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:55,577 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:55,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-03-04 16:17:55,579 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 16:17:55,579 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:17:55,716 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 16:17:55,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-03-04 16:17:55,723 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:17:55,723 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:17:55,723 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:17:55,723 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:17:55,723 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:17:55,723 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:55,723 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:17:55,723 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:17:55,723 INFO L132 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration9_Loop [2025-03-04 16:17:55,723 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:17:55,723 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:17:55,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:55,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:55,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:55,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:55,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:17:55,757 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:17:55,757 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:17:55,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:55,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:55,759 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:55,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-03-04 16:17:55,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:17:55,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:17:55,770 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:17:55,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:17:55,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:17:55,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:17:55,771 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:17:55,771 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:17:55,772 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:17:55,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-03-04 16:17:55,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:55,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:55,780 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:55,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-03-04 16:17:55,783 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:17:55,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:17:55,792 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:17:55,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:17:55,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:17:55,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:17:55,793 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:17:55,793 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:17:55,794 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:17:55,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-03-04 16:17:55,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:55,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:55,801 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:55,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-03-04 16:17:55,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:17:55,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:17:55,812 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:17:55,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:17:55,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:17:55,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:17:55,813 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:17:55,813 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:17:55,814 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:17:55,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-03-04 16:17:55,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:55,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:55,821 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:55,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-03-04 16:17:55,823 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:17:55,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:17:55,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:17:55,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:17:55,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:17:55,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:17:55,833 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:17:55,833 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:17:55,835 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:17:55,836 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-04 16:17:55,836 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 16:17:55,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:17:55,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:55,839 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:17:55,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-03-04 16:17:55,840 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:17:55,840 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 16:17:55,840 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:17:55,840 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_~m) = 1*mult_~m Supporting invariants [] [2025-03-04 16:17:55,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2025-03-04 16:17:55,848 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 16:17:55,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:17:55,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 16:17:55,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 16:17:55,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:55,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:17:55,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 16:17:55,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:17:55,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:17:55,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:17:55,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:55,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:17:55,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 16:17:55,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:17:55,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:17:55,947 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2025-03-04 16:17:55,947 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 191 states and 257 transitions. cyclomatic complexity: 75 Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 16:17:56,015 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 191 states and 257 transitions. cyclomatic complexity: 75. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 232 states and 303 transitions. Complement of second has 11 states. [2025-03-04 16:17:56,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 16:17:56,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 16:17:56,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2025-03-04 16:17:56,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 22 letters. Loop has 3 letters. [2025-03-04 16:17:56,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:17:56,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 25 letters. Loop has 3 letters. [2025-03-04 16:17:56,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:17:56,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 22 letters. Loop has 6 letters. [2025-03-04 16:17:56,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:17:56,019 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 232 states and 303 transitions. [2025-03-04 16:17:56,020 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 42 [2025-03-04 16:17:56,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 232 states to 222 states and 293 transitions. [2025-03-04 16:17:56,023 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 188 [2025-03-04 16:17:56,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 190 [2025-03-04 16:17:56,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 222 states and 293 transitions. [2025-03-04 16:17:56,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:17:56,023 INFO L218 hiAutomatonCegarLoop]: Abstraction has 222 states and 293 transitions. [2025-03-04 16:17:56,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states and 293 transitions. [2025-03-04 16:17:56,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 209. [2025-03-04 16:17:56,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 156 states have (on average 1.2692307692307692) internal successors, (198), 162 states have internal predecessors, (198), 34 states have call successors, (37), 25 states have call predecessors, (37), 19 states have return successors, (44), 21 states have call predecessors, (44), 23 states have call successors, (44) [2025-03-04 16:17:56,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 279 transitions. [2025-03-04 16:17:56,030 INFO L240 hiAutomatonCegarLoop]: Abstraction has 209 states and 279 transitions. [2025-03-04 16:17:56,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:17:56,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 16:17:56,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 16:17:56,031 INFO L87 Difference]: Start difference. First operand 209 states and 279 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 16:17:56,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:17:56,054 INFO L93 Difference]: Finished difference Result 205 states and 270 transitions. [2025-03-04 16:17:56,054 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 205 states and 270 transitions. [2025-03-04 16:17:56,056 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 36 [2025-03-04 16:17:56,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 205 states to 145 states and 177 transitions. [2025-03-04 16:17:56,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 135 [2025-03-04 16:17:56,057 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 135 [2025-03-04 16:17:56,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 145 states and 177 transitions. [2025-03-04 16:17:56,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:17:56,057 INFO L218 hiAutomatonCegarLoop]: Abstraction has 145 states and 177 transitions. [2025-03-04 16:17:56,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states and 177 transitions. [2025-03-04 16:17:56,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 125. [2025-03-04 16:17:56,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 95 states have (on average 1.1368421052631579) internal successors, (108), 100 states have internal predecessors, (108), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (28), 11 states have call predecessors, (28), 14 states have call successors, (28) [2025-03-04 16:17:56,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 154 transitions. [2025-03-04 16:17:56,060 INFO L240 hiAutomatonCegarLoop]: Abstraction has 125 states and 154 transitions. [2025-03-04 16:17:56,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 16:17:56,062 INFO L432 stractBuchiCegarLoop]: Abstraction has 125 states and 154 transitions. [2025-03-04 16:17:56,062 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-04 16:17:56,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 154 transitions. [2025-03-04 16:17:56,063 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 36 [2025-03-04 16:17:56,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:17:56,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:17:56,063 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:17:56,063 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 16:17:56,064 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;havoc main_#t~nondet12#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;" "assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1;" "call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1);"< "~n := #in~n;~m := #in~m;" "assume !(~n <= 1);" "assume !(2 == ~n);" "assume ~n > 2;" "assume !(~m <= 1);" "call #t~ret10 := multiple_of(~n, ~m);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume !(~n < 0);" "assume !(0 == ~m);" "assume !(0 == ~n);" "call #t~ret8 := multiple_of(~n - ~m, ~m);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume ~n < 0;" "call #t~ret7 := multiple_of(-~n, ~m);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume !(~n < 0);" "assume !(0 == ~m);" "assume !(0 == ~n);" [2025-03-04 16:17:56,064 INFO L754 eck$LassoCheckResult]: Loop: "call #t~ret8 := multiple_of(~n - ~m, ~m);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume ~n < 0;" "call #t~ret7 := multiple_of(-~n, ~m);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume !(~n < 0);" "assume !(0 == ~m);" "assume !(0 == ~n);" [2025-03-04 16:17:56,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:17:56,064 INFO L85 PathProgramCache]: Analyzing trace with hash -249976348, now seen corresponding path program 1 times [2025-03-04 16:17:56,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:17:56,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728278093] [2025-03-04 16:17:56,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:17:56,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:17:56,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 16:17:56,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 16:17:56,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:56,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:17:56,125 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:17:56,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:17:56,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728278093] [2025-03-04 16:17:56,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728278093] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:17:56,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328755404] [2025-03-04 16:17:56,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:17:56,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:17:56,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:17:56,128 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:17:56,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2025-03-04 16:17:56,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 16:17:56,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 16:17:56,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:56,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:17:56,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 16:17:56,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:17:56,187 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:17:56,188 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:17:56,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2025-03-04 16:17:56,269 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:17:56,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328755404] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:17:56,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:17:56,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-04 16:17:56,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417414581] [2025-03-04 16:17:56,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:17:56,270 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:17:56,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:17:56,270 INFO L85 PathProgramCache]: Analyzing trace with hash -866811920, now seen corresponding path program 1 times [2025-03-04 16:17:56,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:17:56,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418495999] [2025-03-04 16:17:56,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:17:56,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:17:56,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 16:17:56,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 16:17:56,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:56,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:17:56,273 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:17:56,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 16:17:56,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 16:17:56,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:56,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:17:56,275 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:17:56,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:17:56,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 16:17:56,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-04 16:17:56,455 INFO L87 Difference]: Start difference. First operand 125 states and 154 transitions. cyclomatic complexity: 35 Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 8 states have internal predecessors, (34), 6 states have call successors, (7), 7 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:17:56,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:17:56,585 INFO L93 Difference]: Finished difference Result 149 states and 188 transitions. [2025-03-04 16:17:56,585 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 188 transitions. [2025-03-04 16:17:56,587 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 36 [2025-03-04 16:17:56,588 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 147 states and 186 transitions. [2025-03-04 16:17:56,588 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 132 [2025-03-04 16:17:56,588 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 132 [2025-03-04 16:17:56,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 147 states and 186 transitions. [2025-03-04 16:17:56,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:17:56,588 INFO L218 hiAutomatonCegarLoop]: Abstraction has 147 states and 186 transitions. [2025-03-04 16:17:56,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 186 transitions. [2025-03-04 16:17:56,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2025-03-04 16:17:56,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 110 states have (on average 1.1090909090909091) internal successors, (122), 114 states have internal predecessors, (122), 20 states have call successors, (20), 15 states have call predecessors, (20), 13 states have return successors, (31), 13 states have call predecessors, (31), 17 states have call successors, (31) [2025-03-04 16:17:56,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 173 transitions. [2025-03-04 16:17:56,592 INFO L240 hiAutomatonCegarLoop]: Abstraction has 143 states and 173 transitions. [2025-03-04 16:17:56,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 16:17:56,594 INFO L432 stractBuchiCegarLoop]: Abstraction has 143 states and 173 transitions. [2025-03-04 16:17:56,594 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-04 16:17:56,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 143 states and 173 transitions. [2025-03-04 16:17:56,595 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 36 [2025-03-04 16:17:56,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:17:56,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:17:56,595 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:17:56,596 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 16:17:56,596 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;havoc main_#t~nondet12#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;" "assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1;" "call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1);"< "~n := #in~n;~m := #in~m;" "assume !(~n <= 1);" "assume !(2 == ~n);" "assume ~n > 2;" "assume !(~m <= 1);" "call #t~ret10 := multiple_of(~n, ~m);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume !(~n < 0);" "assume !(0 == ~m);" "assume !(0 == ~n);" "call #t~ret8 := multiple_of(~n - ~m, ~m);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume !(~n < 0);" "assume !(0 == ~m);" "assume !(0 == ~n);" "call #t~ret8 := multiple_of(~n - ~m, ~m);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume ~n < 0;" "call #t~ret7 := multiple_of(-~n, ~m);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume !(~n < 0);" "assume !(0 == ~m);" "assume !(0 == ~n);" [2025-03-04 16:17:56,596 INFO L754 eck$LassoCheckResult]: Loop: "call #t~ret8 := multiple_of(~n - ~m, ~m);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume ~n < 0;" "call #t~ret7 := multiple_of(-~n, ~m);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume !(~n < 0);" "assume !(0 == ~m);" "assume !(0 == ~n);" [2025-03-04 16:17:56,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:17:56,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1817328284, now seen corresponding path program 2 times [2025-03-04 16:17:56,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:17:56,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578402260] [2025-03-04 16:17:56,597 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:17:56,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:17:56,601 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 16:17:56,607 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 16:17:56,608 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:17:56,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:17:56,608 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:17:56,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 16:17:56,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 16:17:56,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:56,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:17:56,614 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:17:56,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:17:56,615 INFO L85 PathProgramCache]: Analyzing trace with hash -866811920, now seen corresponding path program 2 times [2025-03-04 16:17:56,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:17:56,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308354711] [2025-03-04 16:17:56,615 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:17:56,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:17:56,616 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-04 16:17:56,618 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 16:17:56,618 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:17:56,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:17:56,618 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:17:56,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 16:17:56,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 16:17:56,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:56,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:17:56,620 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:17:56,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:17:56,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1897886923, now seen corresponding path program 3 times [2025-03-04 16:17:56,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:17:56,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331907865] [2025-03-04 16:17:56,620 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:17:56,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:17:56,623 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 5 equivalence classes. [2025-03-04 16:17:56,629 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 16:17:56,629 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-04 16:17:56,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:17:56,629 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:17:56,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 16:17:56,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 16:17:56,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:56,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:17:56,635 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:17:57,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 16:17:57,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 16:17:57,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:57,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:17:57,365 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:17:57,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 16:17:57,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 16:17:57,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:17:57,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:17:57,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 04:17:57 BoogieIcfgContainer [2025-03-04 16:17:57,395 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 16:17:57,395 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 16:17:57,395 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 16:17:57,395 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 16:17:57,396 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:17:48" (3/4) ... [2025-03-04 16:17:57,397 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-03-04 16:17:57,426 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 16:17:57,426 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 16:17:57,426 INFO L158 Benchmark]: Toolchain (without parser) took 9342.00ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 44.9MB in the end (delta: 66.6MB). Peak memory consumption was 62.8MB. Max. memory is 16.1GB. [2025-03-04 16:17:57,426 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:17:57,426 INFO L158 Benchmark]: CACSL2BoogieTranslator took 175.32ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 100.3MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 16:17:57,427 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.68ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 99.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:17:57,427 INFO L158 Benchmark]: Boogie Preprocessor took 31.99ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 97.9MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 16:17:57,427 INFO L158 Benchmark]: IcfgBuilder took 292.28ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 84.6MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 16:17:57,427 INFO L158 Benchmark]: BuchiAutomizer took 8781.85ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 48.0MB in the end (delta: 36.6MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2025-03-04 16:17:57,427 INFO L158 Benchmark]: Witness Printer took 30.64ms. Allocated memory is still 142.6MB. Free memory was 48.0MB in the beginning and 44.9MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:17:57,428 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 175.32ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 100.3MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.68ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 99.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.99ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 97.9MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 292.28ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 84.6MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 8781.85ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 48.0MB in the end (delta: 36.6MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Witness Printer took 30.64ms. Allocated memory is still 142.6MB. Free memory was 48.0MB in the beginning and 44.9MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 15 terminating modules (8 trivial, 7 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function \old(m) and consists of 15 locations. One deterministic module has affine ranking function m and consists of 5 locations. One deterministic module has affine ranking function ((long long) -1 * \old(m)) and consists of 5 locations. One deterministic module has affine ranking function ((long long) -1 * \old(n)) and consists of 5 locations. One deterministic module has affine ranking function \old(n) and consists of 8 locations. One deterministic module has affine ranking function m and consists of 8 locations. One deterministic module has affine ranking function m and consists of 5 locations. 8 modules have a trivial ranking function, the largest among these consists of 14 locations. The remainder module has 143 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.7s and 11 iterations. TraceHistogramMax:4. Analysis of lassos took 5.8s. Construction of modules took 0.7s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 11. Automata minimization 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 303 StatesRemovedByMinimization, 15 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [7, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/7 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 632 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 608 mSDsluCounter, 2124 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1458 mSDsCounter, 182 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1128 IncrementalHoareTripleChecker+Invalid, 1310 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 182 mSolverCounterUnsat, 666 mSDtfsCounter, 1128 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT2 conc0 concLT1 SILN1 SILU0 SILI0 SILT4 lasso0 LassoPreprocessingBenchmarks: Lassos: inital20 mio100 ax100 hnf100 lsp79 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq170 hnf93 smp89 dnf100 smp100 tf109 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 19 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.1s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 44]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L77] int n = __VERIFIER_nondet_int(); [L78] COND FALSE !(n < 1 || n > 46340) [L83] CALL is_prime(n) [L53] CALL is_prime_(n, n - 1) VAL [\old(m)=2, \old(n)=3] [L58] COND FALSE !(n <= 1) VAL [\old(m)=2, \old(n)=3, m=2, n=3] [L61] COND FALSE !(n == 2) VAL [\old(m)=2, \old(n)=3, m=2, n=3] [L64] COND TRUE n > 2 VAL [\old(m)=2, \old(n)=3, m=2, n=3] [L65] COND FALSE !(m <= 1) VAL [\old(m)=2, \old(n)=3, m=2, n=3] [L68] CALL multiple_of(n, m) VAL [\old(m)=2, \old(n)=3] [L32] COND FALSE !(m < 0) VAL [\old(m)=2, \old(n)=3, m=2, n=3] [L35] COND FALSE !(n < 0) VAL [\old(m)=2, \old(n)=3, m=2, n=3] [L38] COND FALSE !(m == 0) VAL [\old(m)=2, \old(n)=3, m=2, n=3] [L41] COND FALSE !(n == 0) VAL [\old(m)=2, \old(n)=3, m=2, n=3] [L44] CALL multiple_of(n - m, m) VAL [\old(m)=2, \old(n)=1] [L32] COND FALSE !(m < 0) VAL [\old(m)=2, \old(n)=1, m=2, n=1] [L35] COND FALSE !(n < 0) VAL [\old(m)=2, \old(n)=1, m=2, n=1] [L38] COND FALSE !(m == 0) VAL [\old(m)=2, \old(n)=1, m=2, n=1] [L41] COND FALSE !(n == 0) VAL [\old(m)=2, \old(n)=1, m=2, n=1] [L44] CALL multiple_of(n - m, m) VAL [\old(m)=2, \old(n)=-1] [L32] COND FALSE !(m < 0) VAL [\old(m)=2, \old(n)=-1, m=2, n=-1] [L35] COND TRUE n < 0 VAL [\old(m)=2, \old(n)=-1, m=2, n=-1] [L36] CALL multiple_of(-n, m) VAL [\old(m)=2, \old(n)=1] [L32] COND FALSE !(m < 0) VAL [\old(m)=2, \old(n)=1, m=2, n=1] [L35] COND FALSE !(n < 0) VAL [\old(m)=2, \old(n)=1, m=2, n=1] [L38] COND FALSE !(m == 0) VAL [\old(m)=2, \old(n)=1, m=2, n=1] [L41] COND FALSE !(n == 0) VAL [\old(m)=2, \old(n)=1, m=2, n=1] Loop: [L44] CALL multiple_of(n - m, m) [L32] COND FALSE !(m < 0) [L35] COND TRUE n < 0 [L36] CALL multiple_of(-n, m) [L32] COND FALSE !(m < 0) [L35] COND FALSE !(n < 0) [L38] COND FALSE !(m == 0) [L41] COND FALSE !(n == 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 44]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L77] int n = __VERIFIER_nondet_int(); [L78] COND FALSE !(n < 1 || n > 46340) [L83] CALL is_prime(n) [L53] CALL is_prime_(n, n - 1) VAL [\old(m)=2, \old(n)=3] [L58] COND FALSE !(n <= 1) VAL [\old(m)=2, \old(n)=3, m=2, n=3] [L61] COND FALSE !(n == 2) VAL [\old(m)=2, \old(n)=3, m=2, n=3] [L64] COND TRUE n > 2 VAL [\old(m)=2, \old(n)=3, m=2, n=3] [L65] COND FALSE !(m <= 1) VAL [\old(m)=2, \old(n)=3, m=2, n=3] [L68] CALL multiple_of(n, m) VAL [\old(m)=2, \old(n)=3] [L32] COND FALSE !(m < 0) VAL [\old(m)=2, \old(n)=3, m=2, n=3] [L35] COND FALSE !(n < 0) VAL [\old(m)=2, \old(n)=3, m=2, n=3] [L38] COND FALSE !(m == 0) VAL [\old(m)=2, \old(n)=3, m=2, n=3] [L41] COND FALSE !(n == 0) VAL [\old(m)=2, \old(n)=3, m=2, n=3] [L44] CALL multiple_of(n - m, m) VAL [\old(m)=2, \old(n)=1] [L32] COND FALSE !(m < 0) VAL [\old(m)=2, \old(n)=1, m=2, n=1] [L35] COND FALSE !(n < 0) VAL [\old(m)=2, \old(n)=1, m=2, n=1] [L38] COND FALSE !(m == 0) VAL [\old(m)=2, \old(n)=1, m=2, n=1] [L41] COND FALSE !(n == 0) VAL [\old(m)=2, \old(n)=1, m=2, n=1] [L44] CALL multiple_of(n - m, m) VAL [\old(m)=2, \old(n)=-1] [L32] COND FALSE !(m < 0) VAL [\old(m)=2, \old(n)=-1, m=2, n=-1] [L35] COND TRUE n < 0 VAL [\old(m)=2, \old(n)=-1, m=2, n=-1] [L36] CALL multiple_of(-n, m) VAL [\old(m)=2, \old(n)=1] [L32] COND FALSE !(m < 0) VAL [\old(m)=2, \old(n)=1, m=2, n=1] [L35] COND FALSE !(n < 0) VAL [\old(m)=2, \old(n)=1, m=2, n=1] [L38] COND FALSE !(m == 0) VAL [\old(m)=2, \old(n)=1, m=2, n=1] [L41] COND FALSE !(n == 0) VAL [\old(m)=2, \old(n)=1, m=2, n=1] Loop: [L44] CALL multiple_of(n - m, m) [L32] COND FALSE !(m < 0) [L35] COND TRUE n < 0 [L36] CALL multiple_of(-n, m) [L32] COND FALSE !(m < 0) [L35] COND FALSE !(n < 0) [L38] COND FALSE !(m == 0) [L41] COND FALSE !(n == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-03-04 16:17:57,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Forceful destruction successful, exit code 0 [2025-03-04 16:17:57,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 16:17:57,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)