./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 8fc3dc66 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-?-8fc3dc6-m [2025-03-17 20:35:00,246 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 20:35:00,294 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-17 20:35:00,298 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 20:35:00,298 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 20:35:00,298 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 20:35:00,319 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 20:35:00,319 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 20:35:00,319 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 20:35:00,320 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 20:35:00,320 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 20:35:00,320 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 20:35:00,320 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 20:35:00,320 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 20:35:00,320 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 20:35:00,320 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 20:35:00,320 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 20:35:00,320 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 20:35:00,320 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 20:35:00,320 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 20:35:00,320 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 20:35:00,322 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 20:35:00,322 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 20:35:00,322 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 20:35:00,323 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 20:35:00,323 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 20:35:00,323 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 20:35:00,323 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 20:35:00,323 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 20:35:00,323 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 20:35:00,323 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 20:35:00,323 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 20:35:00,323 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 20:35:00,324 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 20:35:00,324 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 20:35:00,324 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 20:35:00,324 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 20:35:00,324 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 20:35:00,324 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 20:35:00,324 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 20:35:00,324 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-17 20:35:00,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 20:35:00,561 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 20:35:00,562 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 20:35:00,564 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 20:35:00,564 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 20:35:00,565 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Primes.c [2025-03-17 20:35:01,657 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8760697aa/7f690c05ba8548e49acd6f82946a1f13/FLAGab2e615f9 [2025-03-17 20:35:01,888 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 20:35:01,894 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Primes.c [2025-03-17 20:35:01,931 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8760697aa/7f690c05ba8548e49acd6f82946a1f13/FLAGab2e615f9 [2025-03-17 20:35:02,236 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8760697aa/7f690c05ba8548e49acd6f82946a1f13 [2025-03-17 20:35:02,238 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 20:35:02,240 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 20:35:02,241 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 20:35:02,241 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 20:35:02,245 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 20:35:02,246 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:35:02" (1/1) ... [2025-03-17 20:35:02,248 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aed9358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:35:02, skipping insertion in model container [2025-03-17 20:35:02,248 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:35:02" (1/1) ... [2025-03-17 20:35:02,261 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 20:35:02,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:35:02,377 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 20:35:02,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:35:02,400 INFO L204 MainTranslator]: Completed translation [2025-03-17 20:35:02,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:35:02 WrapperNode [2025-03-17 20:35:02,401 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 20:35:02,402 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 20:35:02,402 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 20:35:02,402 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 20:35:02,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:35:02" (1/1) ... [2025-03-17 20:35:02,410 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:35:02" (1/1) ... [2025-03-17 20:35:02,420 INFO L138 Inliner]: procedures = 16, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 51 [2025-03-17 20:35:02,420 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 20:35:02,421 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 20:35:02,421 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 20:35:02,421 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 20:35:02,426 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:35:02" (1/1) ... [2025-03-17 20:35:02,426 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:35:02" (1/1) ... [2025-03-17 20:35:02,427 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:35:02" (1/1) ... [2025-03-17 20:35:02,439 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-17 20:35:02,439 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:35:02" (1/1) ... [2025-03-17 20:35:02,439 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:35:02" (1/1) ... [2025-03-17 20:35:02,444 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:35:02" (1/1) ... [2025-03-17 20:35:02,445 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:35:02" (1/1) ... [2025-03-17 20:35:02,449 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:35:02" (1/1) ... [2025-03-17 20:35:02,450 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:35:02" (1/1) ... [2025-03-17 20:35:02,451 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 20:35:02,451 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 20:35:02,451 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 20:35:02,451 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 20:35:02,452 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:35:02" (1/1) ... [2025-03-17 20:35:02,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:02,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:02,476 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-17 20:35:02,478 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-17 20:35:02,495 INFO L130 BoogieDeclarations]: Found specification of procedure multiple_of [2025-03-17 20:35:02,495 INFO L138 BoogieDeclarations]: Found implementation of procedure multiple_of [2025-03-17 20:35:02,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 20:35:02,495 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2025-03-17 20:35:02,495 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2025-03-17 20:35:02,495 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime_ [2025-03-17 20:35:02,495 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime_ [2025-03-17 20:35:02,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 20:35:02,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 20:35:02,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 20:35:02,549 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 20:35:02,551 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 20:35:02,635 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L33: havoc #t~ret6; [2025-03-17 20:35:02,635 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L44: havoc #t~ret8; [2025-03-17 20:35:02,635 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L36: havoc #t~ret7; [2025-03-17 20:35:02,660 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L27: havoc #t~ret5; [2025-03-17 20:35:02,660 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L19: havoc #t~ret4; [2025-03-17 20:35:02,734 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L53: havoc is_prime_#t~ret9#1; [2025-03-17 20:35:02,754 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L71: havoc #t~ret11; [2025-03-17 20:35:02,774 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-17 20:35:02,774 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 20:35:02,784 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 20:35:02,784 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 20:35:02,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:35:02 BoogieIcfgContainer [2025-03-17 20:35:02,784 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 20:35:02,785 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 20:35:02,785 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 20:35:02,789 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 20:35:02,790 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:35:02,790 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 08:35:02" (1/3) ... [2025-03-17 20:35:02,791 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9fa6d9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:35:02, skipping insertion in model container [2025-03-17 20:35:02,791 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:35:02,792 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:35:02" (2/3) ... [2025-03-17 20:35:02,792 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9fa6d9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:35:02, skipping insertion in model container [2025-03-17 20:35:02,793 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:35:02,793 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:35:02" (3/3) ... [2025-03-17 20:35:02,794 INFO L363 chiAutomizerObserver]: Analyzing ICFG Primes.c [2025-03-17 20:35:02,824 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 20:35:02,824 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 20:35:02,824 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 20:35:02,825 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 20:35:02,825 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 20:35:02,825 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 20:35:02,825 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 20:35:02,825 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 20:35:02,828 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 48 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 35 states have internal predecessors, (52), 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-17 20:35:02,839 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2025-03-17 20:35:02,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:35:02,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:35:02,844 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 20:35:02,844 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:35:02,845 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 20:35:02,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 48 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 35 states have internal predecessors, (52), 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-17 20:35:02,847 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2025-03-17 20:35:02,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:35:02,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:35:02,847 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 20:35:02,847 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:35:02,851 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-17 20:35:02,851 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;" >"#96#return;" "assume !(0 == #t~ret10);havoc #t~ret10;" "call #t~ret11 := is_prime_(~n, ~m - 1);"< [2025-03-17 20:35:02,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:35:02,855 INFO L85 PathProgramCache]: Analyzing trace with hash 90363, now seen corresponding path program 1 times [2025-03-17 20:35:02,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:35:02,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858973533] [2025-03-17 20:35:02,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:35:02,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:35:02,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:35:02,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:35:02,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:02,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:35:02,915 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:35:02,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:35:02,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:35:02,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:02,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:35:02,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:35:02,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:35:02,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1239052010, now seen corresponding path program 1 times [2025-03-17 20:35:02,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:35:02,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053840908] [2025-03-17 20:35:02,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:35:02,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:35:02,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 20:35:02,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 20:35:02,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:02,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:35:03,052 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-17 20:35:03,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:35:03,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053840908] [2025-03-17 20:35:03,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053840908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:35:03,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:35:03,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 20:35:03,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057209050] [2025-03-17 20:35:03,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:35:03,056 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:35:03,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:35:03,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 20:35:03,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 20:35:03,074 INFO L87 Difference]: Start difference. First operand has 48 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 35 states have internal predecessors, (52), 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-17 20:35:03,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:35:03,176 INFO L93 Difference]: Finished difference Result 56 states and 82 transitions. [2025-03-17 20:35:03,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 82 transitions. [2025-03-17 20:35:03,181 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2025-03-17 20:35:03,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 40 states and 53 transitions. [2025-03-17 20:35:03,189 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2025-03-17 20:35:03,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2025-03-17 20:35:03,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 53 transitions. [2025-03-17 20:35:03,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:35:03,190 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 53 transitions. [2025-03-17 20:35:03,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 53 transitions. [2025-03-17 20:35:03,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2025-03-17 20:35:03,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 29 states have internal predecessors, (36), 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-17 20:35:03,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2025-03-17 20:35:03,207 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 50 transitions. [2025-03-17 20:35:03,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 20:35:03,210 INFO L432 stractBuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2025-03-17 20:35:03,210 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 20:35:03,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 50 transitions. [2025-03-17 20:35:03,211 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2025-03-17 20:35:03,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:35:03,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:35:03,212 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 20:35:03,212 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:35:03,212 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-17 20:35:03,212 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;" >"#96#return;" "assume !(0 == #t~ret10);havoc #t~ret10;" "call #t~ret11 := is_prime_(~n, ~m - 1);"< [2025-03-17 20:35:03,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:35:03,212 INFO L85 PathProgramCache]: Analyzing trace with hash 90363, now seen corresponding path program 2 times [2025-03-17 20:35:03,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:35:03,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619145514] [2025-03-17 20:35:03,213 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:35:03,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:35:03,216 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:35:03,219 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:35:03,219 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:35:03,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:35:03,219 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:35:03,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:35:03,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:35:03,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:03,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:35:03,224 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:35:03,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:35:03,224 INFO L85 PathProgramCache]: Analyzing trace with hash 256572218, now seen corresponding path program 1 times [2025-03-17 20:35:03,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:35:03,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748261067] [2025-03-17 20:35:03,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:35:03,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:35:03,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 20:35:03,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 20:35:03,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:03,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:35:03,298 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-17 20:35:03,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:35:03,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748261067] [2025-03-17 20:35:03,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748261067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:35:03,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:35:03,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 20:35:03,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252102934] [2025-03-17 20:35:03,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:35:03,300 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:35:03,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:35:03,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 20:35:03,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 20:35:03,302 INFO L87 Difference]: Start difference. First operand 38 states and 50 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-17 20:35:03,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:35:03,370 INFO L93 Difference]: Finished difference Result 44 states and 59 transitions. [2025-03-17 20:35:03,371 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 59 transitions. [2025-03-17 20:35:03,372 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2025-03-17 20:35:03,373 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 59 transitions. [2025-03-17 20:35:03,373 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2025-03-17 20:35:03,373 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2025-03-17 20:35:03,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 59 transitions. [2025-03-17 20:35:03,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:35:03,373 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44 states and 59 transitions. [2025-03-17 20:35:03,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 59 transitions. [2025-03-17 20:35:03,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2025-03-17 20:35:03,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 31 states have internal predecessors, (37), 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-17 20:35:03,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2025-03-17 20:35:03,376 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 53 transitions. [2025-03-17 20:35:03,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 20:35:03,377 INFO L432 stractBuchiCegarLoop]: Abstraction has 40 states and 53 transitions. [2025-03-17 20:35:03,377 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 20:35:03,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 53 transitions. [2025-03-17 20:35:03,378 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2025-03-17 20:35:03,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:35:03,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:35:03,378 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 20:35:03,378 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-17 20:35:03,378 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-17 20:35:03,379 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;" >"#80#return;" "#res := #t~ret8;havoc #t~ret8;" "assume true;" >"#96#return;" "assume !(0 == #t~ret10);havoc #t~ret10;" "call #t~ret11 := is_prime_(~n, ~m - 1);"< [2025-03-17 20:35:03,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:35:03,379 INFO L85 PathProgramCache]: Analyzing trace with hash 90363, now seen corresponding path program 3 times [2025-03-17 20:35:03,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:35:03,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358062481] [2025-03-17 20:35:03,379 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:35:03,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:35:03,383 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:35:03,385 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:35:03,385 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 20:35:03,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:35:03,385 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:35:03,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:35:03,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:35:03,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:03,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:35:03,389 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:35:03,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:35:03,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1445561092, now seen corresponding path program 1 times [2025-03-17 20:35:03,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:35:03,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819082260] [2025-03-17 20:35:03,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:35:03,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:35:03,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 20:35:03,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 20:35:03,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:03,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:35:03,399 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:35:03,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 20:35:03,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 20:35:03,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:03,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:35:03,417 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:35:03,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:35:03,417 INFO L85 PathProgramCache]: Analyzing trace with hash 719523830, now seen corresponding path program 1 times [2025-03-17 20:35:03,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:35:03,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373026039] [2025-03-17 20:35:03,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:35:03,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:35:03,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 20:35:03,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 20:35:03,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:03,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:35:03,572 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-17 20:35:03,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:35:03,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373026039] [2025-03-17 20:35:03,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373026039] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:35:03,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320350971] [2025-03-17 20:35:03,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:35:03,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:35:03,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:03,575 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-17 20:35:03,577 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-17 20:35:03,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 20:35:03,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 20:35:03,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:03,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:35:03,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 20:35:03,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:35:03,725 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-17 20:35:03,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:35:03,954 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-17 20:35:03,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320350971] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:35:03,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:35:03,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 11 [2025-03-17 20:35:03,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162511780] [2025-03-17 20:35:03,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:35:04,223 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:35:04,224 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:35:04,224 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:35:04,224 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:35:04,224 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:35:04,224 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:04,224 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:35:04,224 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:35:04,225 INFO L132 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration3_Loop [2025-03-17 20:35:04,225 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:35:04,225 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:35:04,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:04,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:04,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:04,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:04,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:04,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:04,304 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:35:04,304 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:35:04,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:04,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:04,307 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-17 20:35:04,308 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-17 20:35:04,309 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:35:04,309 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:35:04,322 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:35:04,322 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-17 20:35:04,328 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-17 20:35:04,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:04,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:04,330 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-17 20:35:04,331 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-17 20:35:04,335 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:35:04,335 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:35:04,348 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:35:04,348 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-17 20:35:04,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-03-17 20:35:04,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:04,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:04,355 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-17 20:35:04,356 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-17 20:35:04,357 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:35:04,357 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:35:04,368 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:35:04,368 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-17 20:35:04,374 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-17 20:35:04,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:04,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:04,376 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-17 20:35:04,377 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-17 20:35:04,378 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:35:04,378 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:35:04,394 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-17 20:35:04,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:04,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:04,396 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-17 20:35:04,397 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-17 20:35:04,397 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:35:04,397 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:35:04,558 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:35:04,564 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-17 20:35:04,564 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:35:04,564 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:35:04,564 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:35:04,564 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:35:04,564 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:35:04,564 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:04,564 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:35:04,564 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:35:04,564 INFO L132 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration3_Loop [2025-03-17 20:35:04,564 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:35:04,564 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:35:04,565 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:04,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:04,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:04,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:04,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:04,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:04,613 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:35:04,615 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:35:04,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:04,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:04,618 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-17 20:35:04,619 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-17 20:35:04,620 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-17 20:35:04,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:35:04,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:35:04,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:35:04,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:35:04,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:35:04,634 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:35:04,634 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:35:04,635 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:35:04,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-17 20:35:04,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:04,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:04,644 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-17 20:35:04,644 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-17 20:35:04,645 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-17 20:35:04,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:35:04,655 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:35:04,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:35:04,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:35:04,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:35:04,655 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:35:04,655 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:35:04,656 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:35:04,662 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-17 20:35:04,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:04,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:04,664 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-17 20:35:04,665 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-17 20:35:04,666 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-17 20:35:04,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:35:04,676 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:35:04,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:35:04,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:35:04,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:35:04,677 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:35:04,677 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:35:04,678 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:35:04,683 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-17 20:35:04,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:04,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:04,686 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-17 20:35:04,687 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-17 20:35:04,688 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-17 20:35:04,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:35:04,699 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:35:04,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:35:04,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:35:04,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:35:04,700 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:35:04,700 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:35:04,702 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:35:04,707 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 20:35:04,708 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 20:35:04,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:04,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:04,711 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-17 20:35:04,713 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-17 20:35:04,714 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:35:04,714 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:35:04,714 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:35:04,715 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(is_prime__#in~m) = 1*is_prime__#in~m Supporting invariants [] [2025-03-17 20:35:04,720 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-17 20:35:04,722 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:35:04,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:35:04,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:35:04,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:35:04,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:04,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:35:04,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:35:04,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:35:04,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 20:35:04,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 20:35:04,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:04,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:35:04,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 20:35:04,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:35:04,969 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-17 20:35:04,971 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-17 20:35:04,972 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 53 transitions. cyclomatic complexity: 16 Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 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-17 20:35:05,288 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-17 20:35:05,441 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 53 transitions. cyclomatic complexity: 16. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 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 357 states and 526 transitions. Complement of second has 85 states. [2025-03-17 20:35:05,442 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-17 20:35:05,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 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-17 20:35:05,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 83 transitions. [2025-03-17 20:35:05,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 83 transitions. Stem has 3 letters. Loop has 24 letters. [2025-03-17 20:35:05,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:35:05,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 83 transitions. Stem has 27 letters. Loop has 24 letters. [2025-03-17 20:35:05,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:35:05,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 83 transitions. Stem has 3 letters. Loop has 48 letters. [2025-03-17 20:35:05,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:35:05,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 357 states and 526 transitions. [2025-03-17 20:35:05,454 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 30 [2025-03-17 20:35:05,459 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 357 states to 281 states and 402 transitions. [2025-03-17 20:35:05,459 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 169 [2025-03-17 20:35:05,460 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 172 [2025-03-17 20:35:05,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 281 states and 402 transitions. [2025-03-17 20:35:05,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:35:05,460 INFO L218 hiAutomatonCegarLoop]: Abstraction has 281 states and 402 transitions. [2025-03-17 20:35:05,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states and 402 transitions. [2025-03-17 20:35:05,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 162. [2025-03-17 20:35:05,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 117 states have (on average 1.3162393162393162) internal successors, (154), 118 states have internal predecessors, (154), 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-17 20:35:05,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 219 transitions. [2025-03-17 20:35:05,476 INFO L240 hiAutomatonCegarLoop]: Abstraction has 162 states and 219 transitions. [2025-03-17 20:35:05,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:35:05,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 20:35:05,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-17 20:35:05,477 INFO L87 Difference]: Start difference. First operand 162 states and 219 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 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-17 20:35:05,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:35:05,652 INFO L93 Difference]: Finished difference Result 184 states and 250 transitions. [2025-03-17 20:35:05,652 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 250 transitions. [2025-03-17 20:35:05,654 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2025-03-17 20:35:05,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 116 states and 159 transitions. [2025-03-17 20:35:05,660 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2025-03-17 20:35:05,660 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2025-03-17 20:35:05,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 159 transitions. [2025-03-17 20:35:05,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:35:05,663 INFO L218 hiAutomatonCegarLoop]: Abstraction has 116 states and 159 transitions. [2025-03-17 20:35:05,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 159 transitions. [2025-03-17 20:35:05,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 92. [2025-03-17 20:35:05,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 66 states have (on average 1.393939393939394) internal successors, (92), 70 states have internal predecessors, (92), 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-17 20:35:05,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 125 transitions. [2025-03-17 20:35:05,668 INFO L240 hiAutomatonCegarLoop]: Abstraction has 92 states and 125 transitions. [2025-03-17 20:35:05,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 20:35:05,670 INFO L432 stractBuchiCegarLoop]: Abstraction has 92 states and 125 transitions. [2025-03-17 20:35:05,670 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 20:35:05,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 125 transitions. [2025-03-17 20:35:05,671 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2025-03-17 20:35:05,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:35:05,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:35:05,672 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:35:05,672 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 20:35:05,672 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-17 20:35:05,672 INFO L754 eck$LassoCheckResult]: Loop: "call #t~ret6 := multiple_of(~n, -~m);"< "~n := #in~n;~m := #in~m;" "assume ~m < 0;" [2025-03-17 20:35:05,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:35:05,673 INFO L85 PathProgramCache]: Analyzing trace with hash -316758066, now seen corresponding path program 1 times [2025-03-17 20:35:05,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:35:05,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888943015] [2025-03-17 20:35:05,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:35:05,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:35:05,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 20:35:05,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:35:05,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:05,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:35:05,712 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-17 20:35:05,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:35:05,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888943015] [2025-03-17 20:35:05,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888943015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:35:05,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:35:05,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 20:35:05,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23739156] [2025-03-17 20:35:05,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:35:05,713 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:35:05,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:35:05,713 INFO L85 PathProgramCache]: Analyzing trace with hash 110096, now seen corresponding path program 1 times [2025-03-17 20:35:05,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:35:05,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118204076] [2025-03-17 20:35:05,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:35:05,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:35:05,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:35:05,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:35:05,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:05,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:35:05,718 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:35:05,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:35:05,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:35:05,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:05,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:35:05,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:35:05,783 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:35:05,783 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:35:05,784 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:35:05,784 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:35:05,784 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:35:05,784 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:05,784 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:35:05,784 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:35:05,784 INFO L132 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration4_Loop [2025-03-17 20:35:05,784 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:35:05,784 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:35:05,785 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:05,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:05,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:05,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:05,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:05,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:05,837 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:35:05,837 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:35:05,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:05,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:05,840 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-17 20:35:05,842 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-17 20:35:05,843 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:35:05,843 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:35:05,868 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-17 20:35:05,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:05,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:05,871 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-17 20:35:05,872 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-17 20:35:05,873 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:35:05,873 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:35:06,012 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:35:06,018 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-17 20:35:06,018 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:35:06,018 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:35:06,018 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:35:06,018 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:35:06,018 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:35:06,018 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:06,019 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:35:06,019 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:35:06,019 INFO L132 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration4_Loop [2025-03-17 20:35:06,019 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:35:06,019 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:35:06,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:06,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:06,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:06,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:06,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:06,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:06,072 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:35:06,072 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:35:06,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:06,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:06,074 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-17 20:35:06,076 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-17 20:35:06,077 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-17 20:35:06,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:35:06,086 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:35:06,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:35:06,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:35:06,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:35:06,087 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:35:06,087 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:35:06,088 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:35:06,093 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-17 20:35:06,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:06,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:06,096 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-17 20:35:06,097 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-17 20:35:06,098 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-17 20:35:06,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:35:06,108 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:35:06,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:35:06,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:35:06,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:35:06,109 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:35:06,109 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:35:06,112 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:35:06,114 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-17 20:35:06,114 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 20:35:06,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:06,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:06,117 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-17 20:35:06,119 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-17 20:35:06,119 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:35:06,119 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:35:06,119 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:35:06,120 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_~m) = 1*multiple_of_~m Supporting invariants [] [2025-03-17 20:35:06,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-03-17 20:35:06,127 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:35:06,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:35:06,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 20:35:06,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:35:06,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:06,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:35:06,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 20:35:06,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:35:06,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:35:06,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:35:06,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:06,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:35:06,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 20:35:06,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:35:06,199 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-17 20:35:06,199 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-17 20:35:06,199 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 125 transitions. cyclomatic complexity: 36 Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-17 20:35:06,249 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 125 transitions. cyclomatic complexity: 36. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 190 states and 252 transitions. Complement of second has 18 states. [2025-03-17 20:35:06,250 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-17 20:35:06,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-17 20:35:06,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2025-03-17 20:35:06,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 66 transitions. Stem has 11 letters. Loop has 3 letters. [2025-03-17 20:35:06,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:35:06,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 66 transitions. Stem has 14 letters. Loop has 3 letters. [2025-03-17 20:35:06,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:35:06,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 66 transitions. Stem has 11 letters. Loop has 6 letters. [2025-03-17 20:35:06,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:35:06,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 190 states and 252 transitions. [2025-03-17 20:35:06,255 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 42 [2025-03-17 20:35:06,257 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 190 states to 136 states and 181 transitions. [2025-03-17 20:35:06,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 112 [2025-03-17 20:35:06,258 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2025-03-17 20:35:06,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 181 transitions. [2025-03-17 20:35:06,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:35:06,260 INFO L218 hiAutomatonCegarLoop]: Abstraction has 136 states and 181 transitions. [2025-03-17 20:35:06,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 181 transitions. [2025-03-17 20:35:06,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 107. [2025-03-17 20:35:06,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 76 states have (on average 1.381578947368421) internal successors, (105), 83 states have internal predecessors, (105), 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-17 20:35:06,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 145 transitions. [2025-03-17 20:35:06,267 INFO L240 hiAutomatonCegarLoop]: Abstraction has 107 states and 145 transitions. [2025-03-17 20:35:06,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:35:06,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 20:35:06,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 20:35:06,267 INFO L87 Difference]: Start difference. First operand 107 states and 145 transitions. Second operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-17 20:35:06,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:35:06,295 INFO L93 Difference]: Finished difference Result 97 states and 127 transitions. [2025-03-17 20:35:06,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 127 transitions. [2025-03-17 20:35:06,296 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2025-03-17 20:35:06,299 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 97 states and 127 transitions. [2025-03-17 20:35:06,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2025-03-17 20:35:06,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97 [2025-03-17 20:35:06,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 127 transitions. [2025-03-17 20:35:06,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:35:06,302 INFO L218 hiAutomatonCegarLoop]: Abstraction has 97 states and 127 transitions. [2025-03-17 20:35:06,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 127 transitions. [2025-03-17 20:35:06,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 91. [2025-03-17 20:35:06,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 69 states have internal predecessors, (88), 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-17 20:35:06,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 120 transitions. [2025-03-17 20:35:06,307 INFO L240 hiAutomatonCegarLoop]: Abstraction has 91 states and 120 transitions. [2025-03-17 20:35:06,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 20:35:06,312 INFO L432 stractBuchiCegarLoop]: Abstraction has 91 states and 120 transitions. [2025-03-17 20:35:06,312 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 20:35:06,312 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 120 transitions. [2025-03-17 20:35:06,313 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2025-03-17 20:35:06,313 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:35:06,313 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:35:06,313 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:35:06,313 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 20:35:06,314 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;" >"#92#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-17 20:35:06,314 INFO L754 eck$LassoCheckResult]: Loop: "~n := #in~n;~m := #in~m;" "assume ~m < 0;" "call #t~ret4 := mult(~n, -~m);"< [2025-03-17 20:35:06,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:35:06,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1686957809, now seen corresponding path program 1 times [2025-03-17 20:35:06,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:35:06,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709057546] [2025-03-17 20:35:06,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:35:06,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:35:06,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 20:35:06,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 20:35:06,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:06,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:35:06,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-03-17 20:35:06,383 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-17 20:35:06,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:35:06,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709057546] [2025-03-17 20:35:06,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709057546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:35:06,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:35:06,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 20:35:06,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056805207] [2025-03-17 20:35:06,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:35:06,384 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:35:06,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:35:06,384 INFO L85 PathProgramCache]: Analyzing trace with hash 60568, now seen corresponding path program 1 times [2025-03-17 20:35:06,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:35:06,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399073598] [2025-03-17 20:35:06,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:35:06,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:35:06,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:35:06,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:35:06,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:06,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:35:06,387 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:35:06,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:35:06,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:35:06,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:06,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:35:06,388 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:35:06,421 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:35:06,422 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:35:06,422 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:35:06,422 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:35:06,422 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:35:06,422 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:06,422 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:35:06,422 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:35:06,422 INFO L132 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration5_Loop [2025-03-17 20:35:06,422 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:35:06,422 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:35:06,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:06,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:06,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:06,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:06,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:06,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:06,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:06,469 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:35:06,469 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:35:06,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:06,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:06,471 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-17 20:35:06,472 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-17 20:35:06,473 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:35:06,473 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:35:06,483 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:35:06,483 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#res=0} Honda state: {mult_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:35:06,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-03-17 20:35:06,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:06,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:06,491 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-17 20:35:06,492 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-17 20:35:06,494 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:35:06,494 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:35:06,508 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:35:06,508 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~m=0} Honda state: {mult_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:35:06,514 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-17 20:35:06,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:06,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:06,516 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-17 20:35:06,517 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-17 20:35:06,519 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:35:06,519 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:35:06,530 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:35:06,530 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-17 20:35:06,537 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-17 20:35:06,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:06,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:06,539 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-17 20:35:06,540 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-17 20:35:06,541 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:35:06,542 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:35:06,552 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:35:06,553 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~n=0} Honda state: {mult_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:35:06,558 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-17 20:35:06,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:06,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:06,560 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-17 20:35:06,561 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-17 20:35:06,563 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:35:06,563 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:35:06,574 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:35:06,574 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-17 20:35:06,580 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-17 20:35:06,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:06,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:06,582 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-17 20:35:06,583 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-17 20:35:06,584 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:35:06,584 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:35:06,595 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:35:06,595 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-17 20:35:06,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-17 20:35:06,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:06,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:06,602 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-17 20:35:06,603 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-17 20:35:06,604 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:35:06,604 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:35:06,620 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-17 20:35:06,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:06,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:06,622 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-17 20:35:06,623 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-17 20:35:06,624 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:35:06,624 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:35:06,663 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:35:06,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-03-17 20:35:06,668 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:35:06,668 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:35:06,668 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:35:06,668 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:35:06,668 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:35:06,668 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:06,668 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:35:06,668 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:35:06,668 INFO L132 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration5_Loop [2025-03-17 20:35:06,668 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:35:06,668 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:35:06,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:06,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:06,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:06,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:06,675 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:06,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:06,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:06,706 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:35:06,707 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:35:06,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:06,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:06,708 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-17 20:35:06,710 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-17 20:35:06,711 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-17 20:35:06,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:35:06,721 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:35:06,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:35:06,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:35:06,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:35:06,721 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:35:06,721 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:35:06,722 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:35:06,728 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-17 20:35:06,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:06,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:06,729 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-17 20:35:06,730 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-17 20:35:06,731 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-17 20:35:06,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:35:06,741 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:35:06,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:35:06,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:35:06,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:35:06,745 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:35:06,745 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:35:06,746 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:35:06,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-03-17 20:35:06,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:06,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:06,755 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-17 20:35:06,757 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-17 20:35:06,759 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-17 20:35:06,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:35:06,770 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:35:06,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:35:06,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:35:06,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:35:06,771 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:35:06,771 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:35:06,772 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:35:06,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-03-17 20:35:06,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:06,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:06,780 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-17 20:35:06,781 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-17 20:35:06,782 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-17 20:35:06,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:35:06,794 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:35:06,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:35:06,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:35:06,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:35:06,794 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:35:06,794 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:35:06,795 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:35:06,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-03-17 20:35:06,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:06,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:06,803 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-17 20:35:06,804 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-17 20:35:06,804 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-17 20:35:06,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:35:06,814 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:35:06,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:35:06,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:35:06,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:35:06,815 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:35:06,815 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:35:06,816 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:35:06,821 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-17 20:35:06,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:06,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:06,823 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-17 20:35:06,824 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-17 20:35:06,824 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-17 20:35:06,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:35:06,836 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:35:06,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:35:06,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:35:06,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:35:06,837 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:35:06,837 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:35:06,838 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:35:06,880 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-17 20:35:06,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:06,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:06,881 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-17 20:35:06,883 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-17 20:35:06,883 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-17 20:35:06,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:35:06,893 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:35:06,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:35:06,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:35:06,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:35:06,894 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:35:06,894 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:35:06,896 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:35:06,898 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-17 20:35:06,898 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 20:35:06,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:06,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:06,899 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-17 20:35:06,900 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-17 20:35:06,901 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:35:06,901 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:35:06,901 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:35:06,901 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_#in~m) = -1*mult_#in~m Supporting invariants [] [2025-03-17 20:35:06,907 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-17 20:35:06,907 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:35:06,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:35:06,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 20:35:06,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 20:35:06,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:06,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:35:06,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 20:35:06,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:35:06,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:35:06,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:35:06,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:06,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:35:06,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 20:35:07,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:35:07,022 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-17 20:35:07,022 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-17 20:35:07,022 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 91 states and 120 transitions. cyclomatic complexity: 32 Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-17 20:35:07,090 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 91 states and 120 transitions. cyclomatic complexity: 32. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 113 states and 144 transitions. Complement of second has 14 states. [2025-03-17 20:35:07,091 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-17 20:35:07,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-17 20:35:07,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2025-03-17 20:35:07,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 13 letters. Loop has 3 letters. [2025-03-17 20:35:07,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:35:07,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 16 letters. Loop has 3 letters. [2025-03-17 20:35:07,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:35:07,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 13 letters. Loop has 6 letters. [2025-03-17 20:35:07,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:35:07,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 144 transitions. [2025-03-17 20:35:07,093 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2025-03-17 20:35:07,094 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 105 states and 136 transitions. [2025-03-17 20:35:07,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2025-03-17 20:35:07,094 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 100 [2025-03-17 20:35:07,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 136 transitions. [2025-03-17 20:35:07,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:35:07,094 INFO L218 hiAutomatonCegarLoop]: Abstraction has 105 states and 136 transitions. [2025-03-17 20:35:07,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 136 transitions. [2025-03-17 20:35:07,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 96. [2025-03-17 20:35:07,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 72 states have internal predecessors, (94), 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-17 20:35:07,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 127 transitions. [2025-03-17 20:35:07,099 INFO L240 hiAutomatonCegarLoop]: Abstraction has 96 states and 127 transitions. [2025-03-17 20:35:07,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:35:07,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 20:35:07,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 20:35:07,103 INFO L87 Difference]: Start difference. First operand 96 states and 127 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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-17 20:35:07,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:35:07,123 INFO L93 Difference]: Finished difference Result 107 states and 138 transitions. [2025-03-17 20:35:07,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 138 transitions. [2025-03-17 20:35:07,124 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2025-03-17 20:35:07,125 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 100 states and 130 transitions. [2025-03-17 20:35:07,125 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2025-03-17 20:35:07,125 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97 [2025-03-17 20:35:07,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 130 transitions. [2025-03-17 20:35:07,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:35:07,125 INFO L218 hiAutomatonCegarLoop]: Abstraction has 100 states and 130 transitions. [2025-03-17 20:35:07,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 130 transitions. [2025-03-17 20:35:07,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2025-03-17 20:35:07,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.3142857142857143) internal successors, (92), 72 states have internal predecessors, (92), 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-17 20:35:07,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 125 transitions. [2025-03-17 20:35:07,130 INFO L240 hiAutomatonCegarLoop]: Abstraction has 96 states and 125 transitions. [2025-03-17 20:35:07,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 20:35:07,131 INFO L432 stractBuchiCegarLoop]: Abstraction has 96 states and 125 transitions. [2025-03-17 20:35:07,131 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-17 20:35:07,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 125 transitions. [2025-03-17 20:35:07,132 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2025-03-17 20:35:07,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:35:07,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:35:07,132 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:35:07,132 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 20:35:07,132 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-17 20:35:07,132 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-17 20:35:07,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:35:07,133 INFO L85 PathProgramCache]: Analyzing trace with hash 538177942, now seen corresponding path program 1 times [2025-03-17 20:35:07,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:35:07,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808900542] [2025-03-17 20:35:07,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:35:07,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:35:07,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 20:35:07,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 20:35:07,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:07,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:35:07,204 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-17 20:35:07,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:35:07,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808900542] [2025-03-17 20:35:07,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808900542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:35:07,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:35:07,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 20:35:07,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537412561] [2025-03-17 20:35:07,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:35:07,204 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:35:07,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:35:07,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1445735, now seen corresponding path program 1 times [2025-03-17 20:35:07,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:35:07,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792213112] [2025-03-17 20:35:07,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:35:07,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:35:07,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:35:07,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:35:07,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:07,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:35:07,207 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:35:07,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:35:07,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:35:07,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:07,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:35:07,208 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:35:07,241 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:35:07,241 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:35:07,241 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:35:07,241 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:35:07,241 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:35:07,241 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:07,241 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:35:07,241 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:35:07,241 INFO L132 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration6_Loop [2025-03-17 20:35:07,241 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:35:07,242 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:35:07,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:07,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:07,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:07,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:07,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:07,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:07,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:07,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:07,286 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:35:07,286 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:35:07,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:07,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:07,289 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-17 20:35:07,289 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-17 20:35:07,290 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:35:07,290 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:35:07,306 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-17 20:35:07,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:07,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:07,307 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-17 20:35:07,308 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-17 20:35:07,309 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:35:07,309 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:35:07,346 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:35:07,350 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-17 20:35:07,350 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:35:07,350 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:35:07,350 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:35:07,350 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:35:07,350 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:35:07,350 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:07,350 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:35:07,350 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:35:07,350 INFO L132 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration6_Loop [2025-03-17 20:35:07,350 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:35:07,350 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:35:07,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:07,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:07,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:07,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:07,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:07,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:07,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:07,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:07,391 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:35:07,391 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:35:07,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:07,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:07,393 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-17 20:35:07,394 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-17 20:35:07,395 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-17 20:35:07,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:35:07,405 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:35:07,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:35:07,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:35:07,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:35:07,405 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:35:07,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:35:07,407 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:35:07,408 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-17 20:35:07,408 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 20:35:07,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:07,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:07,410 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-17 20:35:07,411 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-17 20:35:07,412 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:35:07,412 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:35:07,412 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:35:07,412 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_#in~n) = -1*multiple_of_#in~n Supporting invariants [] [2025-03-17 20:35:07,418 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-17 20:35:07,419 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:35:07,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:35:07,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 20:35:07,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 20:35:07,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:07,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:35:07,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 20:35:07,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:35:07,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:35:07,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:35:07,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:07,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:35:07,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 20:35:07,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:35:07,492 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Exception during sending of exit command (exit): Broken pipe [2025-03-17 20:35:07,494 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-17 20:35:07,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-03-17 20:35:07,514 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-17 20:35:07,515 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-17 20:35:07,515 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 125 transitions. cyclomatic complexity: 33 Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-17 20:35:07,566 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 125 transitions. cyclomatic complexity: 33. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 199 states and 268 transitions. Complement of second has 17 states. [2025-03-17 20:35:07,569 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-17 20:35:07,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-17 20:35:07,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2025-03-17 20:35:07,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 55 transitions. Stem has 13 letters. Loop has 4 letters. [2025-03-17 20:35:07,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:35:07,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 55 transitions. Stem has 17 letters. Loop has 4 letters. [2025-03-17 20:35:07,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:35:07,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 55 transitions. Stem has 13 letters. Loop has 8 letters. [2025-03-17 20:35:07,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:35:07,570 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 199 states and 268 transitions. [2025-03-17 20:35:07,572 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 48 [2025-03-17 20:35:07,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 199 states to 187 states and 256 transitions. [2025-03-17 20:35:07,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 172 [2025-03-17 20:35:07,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2025-03-17 20:35:07,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 187 states and 256 transitions. [2025-03-17 20:35:07,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:35:07,576 INFO L218 hiAutomatonCegarLoop]: Abstraction has 187 states and 256 transitions. [2025-03-17 20:35:07,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states and 256 transitions. [2025-03-17 20:35:07,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 162. [2025-03-17 20:35:07,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 118 states have (on average 1.3305084745762712) internal successors, (157), 124 states have internal predecessors, (157), 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-17 20:35:07,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 222 transitions. [2025-03-17 20:35:07,581 INFO L240 hiAutomatonCegarLoop]: Abstraction has 162 states and 222 transitions. [2025-03-17 20:35:07,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:35:07,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 20:35:07,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 20:35:07,581 INFO L87 Difference]: Start difference. First operand 162 states and 222 transitions. Second operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-17 20:35:07,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:35:07,644 INFO L93 Difference]: Finished difference Result 170 states and 229 transitions. [2025-03-17 20:35:07,644 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 170 states and 229 transitions. [2025-03-17 20:35:07,646 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 42 [2025-03-17 20:35:07,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 170 states to 170 states and 229 transitions. [2025-03-17 20:35:07,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 163 [2025-03-17 20:35:07,647 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 163 [2025-03-17 20:35:07,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 170 states and 229 transitions. [2025-03-17 20:35:07,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:35:07,648 INFO L218 hiAutomatonCegarLoop]: Abstraction has 170 states and 229 transitions. [2025-03-17 20:35:07,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states and 229 transitions. [2025-03-17 20:35:07,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 164. [2025-03-17 20:35:07,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 120 states have (on average 1.3) internal successors, (156), 126 states have internal predecessors, (156), 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-17 20:35:07,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 222 transitions. [2025-03-17 20:35:07,652 INFO L240 hiAutomatonCegarLoop]: Abstraction has 164 states and 222 transitions. [2025-03-17 20:35:07,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 20:35:07,653 INFO L432 stractBuchiCegarLoop]: Abstraction has 164 states and 222 transitions. [2025-03-17 20:35:07,653 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-17 20:35:07,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 164 states and 222 transitions. [2025-03-17 20:35:07,654 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 42 [2025-03-17 20:35:07,654 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:35:07,654 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:35:07,654 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:35:07,654 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-17 20:35:07,654 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-17 20:35:07,654 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-17 20:35:07,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:35:07,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1792884661, now seen corresponding path program 1 times [2025-03-17 20:35:07,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:35:07,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329973303] [2025-03-17 20:35:07,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:35:07,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:35:07,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 20:35:07,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 20:35:07,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:07,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:35:07,660 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:35:07,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 20:35:07,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 20:35:07,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:07,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:35:07,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:35:07,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:35:07,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1389309254, now seen corresponding path program 1 times [2025-03-17 20:35:07,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:35:07,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15113497] [2025-03-17 20:35:07,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:35:07,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:35:07,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 20:35:07,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 20:35:07,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:07,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:35:07,669 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:35:07,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 20:35:07,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 20:35:07,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:07,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:35:07,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:35:07,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:35:07,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1046664698, now seen corresponding path program 2 times [2025-03-17 20:35:07,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:35:07,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427758924] [2025-03-17 20:35:07,671 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:35:07,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:35:07,674 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-17 20:35:07,678 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 20:35:07,680 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:35:07,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:35:07,680 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:35:07,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 20:35:07,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 20:35:07,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:07,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:35:07,688 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:35:07,746 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:35:07,747 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:35:07,747 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:35:07,747 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:35:07,747 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:35:07,747 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:07,747 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:35:07,747 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:35:07,747 INFO L132 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration7_Loop [2025-03-17 20:35:07,747 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:35:07,747 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:35:07,748 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:07,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:07,753 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:07,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:07,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:07,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:07,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:07,805 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:35:07,805 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:35:07,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:07,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:07,808 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-17 20:35:07,810 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-17 20:35:07,810 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:35:07,811 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:35:07,823 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:35:07,823 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-17 20:35:07,829 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-17 20:35:07,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:07,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:07,832 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-17 20:35:07,833 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-17 20:35:07,835 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:35:07,835 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:35:07,846 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:35:07,846 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-17 20:35:07,853 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-17 20:35:07,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:07,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:07,856 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-17 20:35:07,857 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-17 20:35:07,858 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:35:07,858 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:35:07,869 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:35:07,869 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-17 20:35:07,875 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-17 20:35:07,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:07,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:07,877 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-17 20:35:07,879 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-17 20:35:07,880 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:35:07,880 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:35:07,890 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:35:07,890 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-17 20:35:07,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2025-03-17 20:35:07,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:07,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:07,898 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-17 20:35:07,899 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-17 20:35:07,900 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:35:07,900 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:35:07,910 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:35:07,911 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-17 20:35:07,916 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-17 20:35:07,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:07,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:07,918 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-17 20:35:07,919 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-17 20:35:07,919 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:35:07,919 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:35:07,931 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:35:07,931 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-17 20:35:07,936 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-17 20:35:07,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:07,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:07,938 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-17 20:35:07,939 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-17 20:35:07,939 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:35:07,939 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:35:07,957 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-17 20:35:07,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:07,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:07,959 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-17 20:35:07,960 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-17 20:35:07,961 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:35:07,961 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:35:08,014 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:35:08,018 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-17 20:35:08,018 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:35:08,018 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:35:08,018 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:35:08,018 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:35:08,018 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:35:08,018 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:08,018 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:35:08,018 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:35:08,018 INFO L132 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration7_Loop [2025-03-17 20:35:08,018 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:35:08,018 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:35:08,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:08,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:08,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:08,024 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:08,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:08,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:08,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:08,074 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:35:08,074 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:35:08,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:08,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:08,076 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-17 20:35:08,077 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-17 20:35:08,078 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-17 20:35:08,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:35:08,087 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:35:08,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:35:08,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:35:08,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:35:08,088 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:35:08,088 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:35:08,091 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:35:08,097 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-17 20:35:08,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:08,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:08,100 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-17 20:35:08,100 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-17 20:35:08,101 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-17 20:35:08,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:35:08,111 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:35:08,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:35:08,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:35:08,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:35:08,111 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:35:08,111 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:35:08,112 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:35:08,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-03-17 20:35:08,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:08,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:08,120 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-17 20:35:08,121 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-17 20:35:08,122 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-17 20:35:08,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:35:08,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:35:08,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:35:08,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:35:08,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:35:08,132 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:35:08,132 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:35:08,133 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:35:08,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-03-17 20:35:08,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:08,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:08,141 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-17 20:35:08,142 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-17 20:35:08,143 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-17 20:35:08,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:35:08,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:35:08,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:35:08,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:35:08,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:35:08,154 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:35:08,154 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:35:08,155 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:35:08,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-03-17 20:35:08,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:08,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:08,162 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-17 20:35:08,163 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-17 20:35:08,164 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-17 20:35:08,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:35:08,174 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:35:08,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:35:08,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:35:08,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:35:08,175 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:35:08,175 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:35:08,176 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:35:08,181 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-17 20:35:08,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:08,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:08,183 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-17 20:35:08,184 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-17 20:35:08,185 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-17 20:35:08,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:35:08,194 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:35:08,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:35:08,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:35:08,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:35:08,195 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:35:08,195 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:35:08,197 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:35:08,202 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 20:35:08,202 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 20:35:08,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:08,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:08,205 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-17 20:35:08,207 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-17 20:35:08,208 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:35:08,208 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:35:08,208 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:35:08,208 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_#in~n) = 1*multiple_of_#in~n Supporting invariants [] [2025-03-17 20:35:08,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-03-17 20:35:08,216 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:35:08,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:35:08,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 20:35:08,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 20:35:08,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:08,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:35:08,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 20:35:08,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:35:08,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 20:35:08,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 20:35:08,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:08,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:35:08,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:35:08,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:35:08,336 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-17 20:35:08,336 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-17 20:35:08,336 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 164 states and 222 transitions. cyclomatic complexity: 65 Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-17 20:35:08,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-03-17 20:35:08,448 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 164 states and 222 transitions. cyclomatic complexity: 65. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 217 states and 292 transitions. Complement of second has 29 states. [2025-03-17 20:35:08,450 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-17 20:35:08,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-17 20:35:08,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2025-03-17 20:35:08,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 15 letters. Loop has 6 letters. [2025-03-17 20:35:08,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:35:08,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 21 letters. Loop has 6 letters. [2025-03-17 20:35:08,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:35:08,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 15 letters. Loop has 12 letters. [2025-03-17 20:35:08,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:35:08,451 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 217 states and 292 transitions. [2025-03-17 20:35:08,453 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 48 [2025-03-17 20:35:08,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 217 states to 205 states and 278 transitions. [2025-03-17 20:35:08,456 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 182 [2025-03-17 20:35:08,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 184 [2025-03-17 20:35:08,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 205 states and 278 transitions. [2025-03-17 20:35:08,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:35:08,457 INFO L218 hiAutomatonCegarLoop]: Abstraction has 205 states and 278 transitions. [2025-03-17 20:35:08,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states and 278 transitions. [2025-03-17 20:35:08,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 180. [2025-03-17 20:35:08,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 133 states have (on average 1.2932330827067668) internal successors, (172), 140 states have internal predecessors, (172), 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-17 20:35:08,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 244 transitions. [2025-03-17 20:35:08,462 INFO L240 hiAutomatonCegarLoop]: Abstraction has 180 states and 244 transitions. [2025-03-17 20:35:08,462 INFO L432 stractBuchiCegarLoop]: Abstraction has 180 states and 244 transitions. [2025-03-17 20:35:08,462 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-17 20:35:08,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 180 states and 244 transitions. [2025-03-17 20:35:08,463 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 42 [2025-03-17 20:35:08,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:35:08,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:35:08,464 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:35:08,464 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-17 20:35:08,464 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;" >"#92#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-17 20:35:08,464 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-17 20:35:08,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:35:08,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1732342502, now seen corresponding path program 1 times [2025-03-17 20:35:08,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:35:08,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062506797] [2025-03-17 20:35:08,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:35:08,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:35:08,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 20:35:08,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 20:35:08,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:08,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:35:08,473 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:35:08,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 20:35:08,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 20:35:08,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:08,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:35:08,479 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:35:08,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:35:08,482 INFO L85 PathProgramCache]: Analyzing trace with hash 52485045, now seen corresponding path program 1 times [2025-03-17 20:35:08,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:35:08,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109643085] [2025-03-17 20:35:08,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:35:08,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:35:08,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:35:08,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:35:08,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:08,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:35:08,485 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:35:08,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:35:08,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:35:08,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:08,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:35:08,486 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:35:08,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:35:08,487 INFO L85 PathProgramCache]: Analyzing trace with hash 196898800, now seen corresponding path program 1 times [2025-03-17 20:35:08,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:35:08,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427846155] [2025-03-17 20:35:08,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:35:08,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:35:08,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 20:35:08,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 20:35:08,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:08,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:35:08,496 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:35:08,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 20:35:08,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 20:35:08,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:08,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:35:08,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:35:08,570 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:35:08,570 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:35:08,570 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:35:08,570 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:35:08,570 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:35:08,570 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:08,570 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:35:08,570 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:35:08,570 INFO L132 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration8_Loop [2025-03-17 20:35:08,570 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:35:08,571 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:35:08,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:08,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:08,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:08,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:08,581 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:08,624 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:35:08,624 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:35:08,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:08,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:08,660 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-17 20:35:08,661 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-17 20:35:08,661 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:35:08,661 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:35:08,672 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:35:08,672 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#res=0} Honda state: {mult_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:35:08,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2025-03-17 20:35:08,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:08,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:08,679 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-17 20:35:08,680 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-17 20:35:08,681 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:35:08,681 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:35:08,704 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-17 20:35:08,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:08,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:08,706 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-17 20:35:08,707 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-17 20:35:08,707 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:35:08,708 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:35:08,786 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:35:08,791 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-17 20:35:08,791 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:35:08,791 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:35:08,791 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:35:08,791 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:35:08,791 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:35:08,791 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:08,791 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:35:08,791 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:35:08,791 INFO L132 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration8_Loop [2025-03-17 20:35:08,791 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:35:08,791 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:35:08,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:08,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:08,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:08,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:08,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:08,837 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:35:08,837 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:35:08,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:08,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:08,839 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-17 20:35:08,839 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-17 20:35:08,840 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-17 20:35:08,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:35:08,850 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:35:08,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:35:08,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:35:08,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:35:08,850 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:35:08,850 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:35:08,851 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:35:08,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2025-03-17 20:35:08,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:08,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:08,858 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-17 20:35:08,859 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-17 20:35:08,860 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-17 20:35:08,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:35:08,869 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:35:08,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:35:08,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:35:08,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:35:08,870 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:35:08,870 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:35:08,872 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:35:08,874 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 20:35:08,874 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 20:35:08,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:08,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:08,876 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-17 20:35:08,877 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-17 20:35:08,878 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:35:08,878 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:35:08,878 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:35:08,878 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_~m) = 1*mult_~m Supporting invariants [] [2025-03-17 20:35:08,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2025-03-17 20:35:08,888 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:35:08,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:35:08,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 20:35:08,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 20:35:08,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:08,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:35:08,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 20:35:08,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:35:08,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:35:08,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:35:08,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:08,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:35:08,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 20:35:08,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:35:08,995 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-17 20:35:08,996 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-17 20:35:08,996 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 180 states and 244 transitions. cyclomatic complexity: 72 Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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-17 20:35:09,053 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 180 states and 244 transitions. cyclomatic complexity: 72. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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 204 states and 271 transitions. Complement of second has 17 states. [2025-03-17 20:35:09,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-17 20:35:09,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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-17 20:35:09,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2025-03-17 20:35:09,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 51 transitions. Stem has 16 letters. Loop has 5 letters. [2025-03-17 20:35:09,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:35:09,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 51 transitions. Stem has 21 letters. Loop has 5 letters. [2025-03-17 20:35:09,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:35:09,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 51 transitions. Stem has 16 letters. Loop has 10 letters. [2025-03-17 20:35:09,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:35:09,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 204 states and 271 transitions. [2025-03-17 20:35:09,058 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 42 [2025-03-17 20:35:09,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 204 states to 203 states and 270 transitions. [2025-03-17 20:35:09,061 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 176 [2025-03-17 20:35:09,061 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 179 [2025-03-17 20:35:09,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 203 states and 270 transitions. [2025-03-17 20:35:09,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:35:09,062 INFO L218 hiAutomatonCegarLoop]: Abstraction has 203 states and 270 transitions. [2025-03-17 20:35:09,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states and 270 transitions. [2025-03-17 20:35:09,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 190. [2025-03-17 20:35:09,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 141 states have (on average 1.2907801418439717) internal successors, (182), 148 states have internal predecessors, (182), 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-17 20:35:09,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 256 transitions. [2025-03-17 20:35:09,067 INFO L240 hiAutomatonCegarLoop]: Abstraction has 190 states and 256 transitions. [2025-03-17 20:35:09,067 INFO L432 stractBuchiCegarLoop]: Abstraction has 190 states and 256 transitions. [2025-03-17 20:35:09,067 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-17 20:35:09,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 190 states and 256 transitions. [2025-03-17 20:35:09,069 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 42 [2025-03-17 20:35:09,069 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:35:09,069 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:35:09,069 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] [2025-03-17 20:35:09,070 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 20:35:09,070 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;" >"#92#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-17 20:35:09,070 INFO L754 eck$LassoCheckResult]: Loop: "call #t~ret4 := mult(~n, -~m);"< "~n := #in~n;~m := #in~m;" "assume ~m < 0;" [2025-03-17 20:35:09,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:35:09,070 INFO L85 PathProgramCache]: Analyzing trace with hash 196898799, now seen corresponding path program 1 times [2025-03-17 20:35:09,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:35:09,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848915828] [2025-03-17 20:35:09,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:35:09,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:35:09,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 20:35:09,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 20:35:09,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:09,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:35:09,118 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-17 20:35:09,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:35:09,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848915828] [2025-03-17 20:35:09,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848915828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:35:09,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:35:09,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 20:35:09,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640978042] [2025-03-17 20:35:09,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:35:09,119 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:35:09,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:35:09,119 INFO L85 PathProgramCache]: Analyzing trace with hash 114388, now seen corresponding path program 2 times [2025-03-17 20:35:09,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:35:09,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399269387] [2025-03-17 20:35:09,119 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:35:09,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:35:09,121 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:35:09,121 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:35:09,121 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:35:09,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:35:09,121 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:35:09,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:35:09,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:35:09,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:09,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:35:09,124 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:35:09,174 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:35:09,174 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:35:09,174 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:35:09,174 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:35:09,174 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:35:09,174 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:09,174 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:35:09,174 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:35:09,175 INFO L132 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration9_Loop [2025-03-17 20:35:09,175 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:35:09,175 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:35:09,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:09,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:09,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:09,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:09,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:09,217 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:35:09,217 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:35:09,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:09,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:09,220 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-17 20:35:09,222 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-17 20:35:09,223 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:35:09,223 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:35:09,242 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:35:09,242 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-17 20:35:09,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2025-03-17 20:35:09,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:09,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:09,251 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-17 20:35:09,252 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-17 20:35:09,253 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:35:09,253 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:35:09,264 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:35:09,264 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-17 20:35:09,270 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-17 20:35:09,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:09,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:09,272 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-17 20:35:09,274 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-17 20:35:09,275 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:35:09,275 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:35:09,285 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:35:09,285 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-17 20:35:09,291 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-17 20:35:09,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:09,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:09,293 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-17 20:35:09,293 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-17 20:35:09,294 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:35:09,294 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:35:09,317 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-17 20:35:09,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:09,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:09,319 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-17 20:35:09,320 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-17 20:35:09,321 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:35:09,321 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:35:09,455 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:35:09,461 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-17 20:35:09,461 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:35:09,461 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:35:09,461 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:35:09,461 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:35:09,461 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:35:09,461 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:09,461 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:35:09,461 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:35:09,461 INFO L132 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration9_Loop [2025-03-17 20:35:09,461 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:35:09,462 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:35:09,462 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:09,469 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:09,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:09,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:09,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:35:09,518 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-17 20:35:09,583 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:35:09,584 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:35:09,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:09,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:09,586 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-17 20:35:09,587 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-17 20:35:09,588 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-17 20:35:09,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:35:09,598 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:35:09,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:35:09,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:35:09,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:35:09,599 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:35:09,599 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:35:09,607 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:35:09,614 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-17 20:35:09,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:09,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:09,616 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-17 20:35:09,618 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-17 20:35:09,619 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-17 20:35:09,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:35:09,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:35:09,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:35:09,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:35:09,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:35:09,631 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:35:09,631 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:35:09,632 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:35:09,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2025-03-17 20:35:09,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:09,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:09,639 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-17 20:35:09,640 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-17 20:35:09,642 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-17 20:35:09,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:35:09,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:35:09,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:35:09,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:35:09,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:35:09,652 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:35:09,652 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:35:09,653 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:35:09,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2025-03-17 20:35:09,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:09,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:09,661 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-17 20:35:09,662 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-17 20:35:09,663 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-17 20:35:09,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:35:09,673 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:35:09,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:35:09,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:35:09,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:35:09,674 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:35:09,674 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:35:09,676 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:35:09,678 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-17 20:35:09,678 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 20:35:09,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:35:09,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:09,680 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-17 20:35:09,681 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-17 20:35:09,682 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:35:09,682 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:35:09,682 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:35:09,683 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_~m) = 1*mult_~m Supporting invariants [] [2025-03-17 20:35:09,688 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-17 20:35:09,689 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:35:09,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:35:09,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 20:35:09,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 20:35:09,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:09,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:35:09,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 20:35:09,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:35:09,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:35:09,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:35:09,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:09,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:35:09,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 20:35:09,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:35:09,942 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-17 20:35:09,943 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-17 20:35:09,947 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 190 states and 256 transitions. cyclomatic complexity: 75 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, (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-17 20:35:10,002 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 190 states and 256 transitions. cyclomatic complexity: 75. 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, (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 231 states and 302 transitions. Complement of second has 11 states. [2025-03-17 20:35:10,004 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-17 20:35:10,004 INFO L82 GeneralOperation]: Start removeUnreachable. 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, (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-17 20:35:10,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2025-03-17 20:35:10,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 21 letters. Loop has 3 letters. [2025-03-17 20:35:10,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:35:10,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 24 letters. Loop has 3 letters. [2025-03-17 20:35:10,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:35:10,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 21 letters. Loop has 6 letters. [2025-03-17 20:35:10,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:35:10,005 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 231 states and 302 transitions. [2025-03-17 20:35:10,007 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 42 [2025-03-17 20:35:10,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 231 states to 221 states and 292 transitions. [2025-03-17 20:35:10,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 187 [2025-03-17 20:35:10,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 189 [2025-03-17 20:35:10,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 221 states and 292 transitions. [2025-03-17 20:35:10,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:35:10,011 INFO L218 hiAutomatonCegarLoop]: Abstraction has 221 states and 292 transitions. [2025-03-17 20:35:10,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states and 292 transitions. [2025-03-17 20:35:10,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 208. [2025-03-17 20:35:10,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 155 states have (on average 1.270967741935484) internal successors, (197), 161 states have internal predecessors, (197), 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-17 20:35:10,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 278 transitions. [2025-03-17 20:35:10,019 INFO L240 hiAutomatonCegarLoop]: Abstraction has 208 states and 278 transitions. [2025-03-17 20:35:10,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:35:10,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 20:35:10,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 20:35:10,019 INFO L87 Difference]: Start difference. First operand 208 states and 278 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-17 20:35:10,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:35:10,040 INFO L93 Difference]: Finished difference Result 204 states and 269 transitions. [2025-03-17 20:35:10,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 204 states and 269 transitions. [2025-03-17 20:35:10,041 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 36 [2025-03-17 20:35:10,044 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 204 states to 144 states and 176 transitions. [2025-03-17 20:35:10,044 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 134 [2025-03-17 20:35:10,045 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 134 [2025-03-17 20:35:10,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 144 states and 176 transitions. [2025-03-17 20:35:10,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:35:10,045 INFO L218 hiAutomatonCegarLoop]: Abstraction has 144 states and 176 transitions. [2025-03-17 20:35:10,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states and 176 transitions. [2025-03-17 20:35:10,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 124. [2025-03-17 20:35:10,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 94 states have (on average 1.1382978723404256) internal successors, (107), 99 states have internal predecessors, (107), 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-17 20:35:10,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 153 transitions. [2025-03-17 20:35:10,049 INFO L240 hiAutomatonCegarLoop]: Abstraction has 124 states and 153 transitions. [2025-03-17 20:35:10,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 20:35:10,051 INFO L432 stractBuchiCegarLoop]: Abstraction has 124 states and 153 transitions. [2025-03-17 20:35:10,051 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-17 20:35:10,051 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 153 transitions. [2025-03-17 20:35:10,051 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 36 [2025-03-17 20:35:10,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:35:10,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:35:10,052 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:35:10,052 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 20:35:10,052 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-17 20:35:10,052 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-17 20:35:10,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:35:10,052 INFO L85 PathProgramCache]: Analyzing trace with hash 995271503, now seen corresponding path program 1 times [2025-03-17 20:35:10,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:35:10,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361829382] [2025-03-17 20:35:10,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:35:10,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:35:10,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 20:35:10,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 20:35:10,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:10,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:35:10,124 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-17 20:35:10,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:35:10,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361829382] [2025-03-17 20:35:10,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361829382] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:35:10,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010561204] [2025-03-17 20:35:10,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:35:10,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:35:10,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:35:10,126 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-17 20:35:10,128 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-17 20:35:10,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 20:35:10,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 20:35:10,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:10,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:35:10,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 20:35:10,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:35:10,184 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-17 20:35:10,184 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:35:10,242 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-17 20:35:10,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010561204] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:35:10,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:35:10,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-17 20:35:10,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128517311] [2025-03-17 20:35:10,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:35:10,243 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:35:10,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:35:10,243 INFO L85 PathProgramCache]: Analyzing trace with hash -363158858, now seen corresponding path program 1 times [2025-03-17 20:35:10,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:35:10,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188235548] [2025-03-17 20:35:10,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:35:10,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:35:10,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 20:35:10,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 20:35:10,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:10,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:35:10,246 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:35:10,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 20:35:10,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 20:35:10,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:10,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:35:10,248 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:35:10,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2025-03-17 20:35:10,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:35:10,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 20:35:10,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-17 20:35:10,398 INFO L87 Difference]: Start difference. First operand 124 states and 153 transitions. cyclomatic complexity: 35 Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 8 states have internal predecessors, (33), 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-17 20:35:10,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:35:10,509 INFO L93 Difference]: Finished difference Result 148 states and 187 transitions. [2025-03-17 20:35:10,509 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 187 transitions. [2025-03-17 20:35:10,511 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 36 [2025-03-17 20:35:10,512 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 146 states and 185 transitions. [2025-03-17 20:35:10,512 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 131 [2025-03-17 20:35:10,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 131 [2025-03-17 20:35:10,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 146 states and 185 transitions. [2025-03-17 20:35:10,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:35:10,512 INFO L218 hiAutomatonCegarLoop]: Abstraction has 146 states and 185 transitions. [2025-03-17 20:35:10,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states and 185 transitions. [2025-03-17 20:35:10,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 142. [2025-03-17 20:35:10,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 109 states have (on average 1.110091743119266) internal successors, (121), 113 states have internal predecessors, (121), 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-17 20:35:10,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 172 transitions. [2025-03-17 20:35:10,515 INFO L240 hiAutomatonCegarLoop]: Abstraction has 142 states and 172 transitions. [2025-03-17 20:35:10,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 20:35:10,516 INFO L432 stractBuchiCegarLoop]: Abstraction has 142 states and 172 transitions. [2025-03-17 20:35:10,516 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-17 20:35:10,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 172 transitions. [2025-03-17 20:35:10,516 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 36 [2025-03-17 20:35:10,517 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:35:10,517 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:35:10,517 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:35:10,517 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 20:35:10,517 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-17 20:35:10,517 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-17 20:35:10,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:35:10,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1837189802, now seen corresponding path program 2 times [2025-03-17 20:35:10,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:35:10,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846355089] [2025-03-17 20:35:10,518 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:35:10,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:35:10,520 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-17 20:35:10,523 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 20:35:10,523 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:35:10,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:35:10,523 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:35:10,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 20:35:10,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 20:35:10,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:10,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:35:10,528 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:35:10,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:35:10,529 INFO L85 PathProgramCache]: Analyzing trace with hash -363158858, now seen corresponding path program 2 times [2025-03-17 20:35:10,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:35:10,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976254399] [2025-03-17 20:35:10,529 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:35:10,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:35:10,530 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-17 20:35:10,531 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 20:35:10,531 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:35:10,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:35:10,531 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:35:10,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 20:35:10,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 20:35:10,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:10,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:35:10,533 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:35:10,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:35:10,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1857982945, now seen corresponding path program 3 times [2025-03-17 20:35:10,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:35:10,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012829842] [2025-03-17 20:35:10,533 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:35:10,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:35:10,535 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 5 equivalence classes. [2025-03-17 20:35:10,542 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 20:35:10,542 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-17 20:35:10,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:35:10,542 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:35:10,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 20:35:10,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 20:35:10,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:10,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:35:10,550 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:35:11,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 20:35:11,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 20:35:11,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:11,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:35:11,269 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:35:11,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 20:35:11,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 20:35:11,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:35:11,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:35:11,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.03 08:35:11 BoogieIcfgContainer [2025-03-17 20:35:11,300 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-17 20:35:11,301 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 20:35:11,301 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 20:35:11,302 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 20:35:11,302 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:35:02" (3/4) ... [2025-03-17 20:35:11,303 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-03-17 20:35:11,333 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 20:35:11,333 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 20:35:11,333 INFO L158 Benchmark]: Toolchain (without parser) took 9094.10ms. Allocated memory is still 142.6MB. Free memory was 109.4MB in the beginning and 60.9MB in the end (delta: 48.5MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. [2025-03-17 20:35:11,333 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory was 127.7MB in the beginning and 127.4MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:35:11,334 INFO L158 Benchmark]: CACSL2BoogieTranslator took 160.85ms. Allocated memory is still 142.6MB. Free memory was 109.4MB in the beginning and 97.9MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 20:35:11,334 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.60ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 97.4MB in the end (delta: 455.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:35:11,334 INFO L158 Benchmark]: Boogie Preprocessor took 29.96ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 96.3MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 20:35:11,334 INFO L158 Benchmark]: IcfgBuilder took 333.17ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 81.2MB in the end (delta: 15.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 20:35:11,334 INFO L158 Benchmark]: BuchiAutomizer took 8514.94ms. Allocated memory is still 142.6MB. Free memory was 81.2MB in the beginning and 63.7MB in the end (delta: 17.5MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2025-03-17 20:35:11,334 INFO L158 Benchmark]: Witness Printer took 32.16ms. Allocated memory is still 142.6MB. Free memory was 63.7MB in the beginning and 60.9MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:35:11,335 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 was 127.7MB in the beginning and 127.4MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 160.85ms. Allocated memory is still 142.6MB. Free memory was 109.4MB in the beginning and 97.9MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.60ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 97.4MB in the end (delta: 455.5kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.96ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 96.3MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 333.17ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 81.2MB in the end (delta: 15.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 8514.94ms. Allocated memory is still 142.6MB. Free memory was 81.2MB in the beginning and 63.7MB in the end (delta: 17.5MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. * Witness Printer took 32.16ms. Allocated memory is still 142.6MB. Free memory was 63.7MB in the beginning and 60.9MB in the end (delta: 2.8MB). 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 6 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 142 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.4s and 11 iterations. TraceHistogramMax:4. Analysis of lassos took 5.7s. Construction of modules took 0.6s. 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, 628 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 604 mSDsluCounter, 2021 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1370 mSDsCounter, 179 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1080 IncrementalHoareTripleChecker+Invalid, 1259 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 179 mSolverCounterUnsat, 651 mSDtfsCounter, 1080 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: 19ms 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-17 20:35:11,351 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-17 20:35:11,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 20:35:11,752 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)