./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-simple/nested_2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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/loop-simple/nested_2.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 d28004f57c6988e792d07d7254dfd532aeffd19f38063d85c3bfa2c0f504914f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 14:47:13,235 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 14:47:13,291 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-19 14:47:13,295 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 14:47:13,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 14:47:13,316 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 14:47:13,320 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 14:47:13,320 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 14:47:13,320 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 14:47:13,321 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 14:47:13,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 14:47:13,321 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 14:47:13,321 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 14:47:13,322 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 14:47:13,323 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 14:47:13,323 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 14:47:13,325 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 14:47:13,325 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 14:47:13,325 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 14:47:13,325 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 14:47:13,325 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 14:47:13,328 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 14:47:13,328 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 14:47:13,328 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 14:47:13,328 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 14:47:13,328 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 14:47:13,329 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 14:47:13,329 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 14:47:13,329 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 14:47:13,329 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 14:47:13,329 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 14:47:13,329 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 14:47:13,330 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 14:47:13,330 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 14:47:13,330 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 14:47:13,330 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 14:47:13,331 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 14:47:13,331 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 14:47:13,332 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 14:47:13,332 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> d28004f57c6988e792d07d7254dfd532aeffd19f38063d85c3bfa2c0f504914f [2024-11-19 14:47:13,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 14:47:13,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 14:47:13,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 14:47:13,598 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 14:47:13,599 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 14:47:13,600 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-simple/nested_2.c [2024-11-19 14:47:14,909 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 14:47:15,056 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 14:47:15,057 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_2.c [2024-11-19 14:47:15,062 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1e000071/e9fee0f39d7c4bfbb1ef6330d6bf2ab0/FLAG91e21362d [2024-11-19 14:47:15,472 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1e000071/e9fee0f39d7c4bfbb1ef6330d6bf2ab0 [2024-11-19 14:47:15,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 14:47:15,476 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 14:47:15,477 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 14:47:15,477 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 14:47:15,481 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 14:47:15,481 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:47:15" (1/1) ... [2024-11-19 14:47:15,482 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@156b77ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:15, skipping insertion in model container [2024-11-19 14:47:15,482 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:47:15" (1/1) ... [2024-11-19 14:47:15,500 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 14:47:15,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:47:15,645 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 14:47:15,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:47:15,669 INFO L204 MainTranslator]: Completed translation [2024-11-19 14:47:15,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:15 WrapperNode [2024-11-19 14:47:15,670 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 14:47:15,671 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 14:47:15,671 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 14:47:15,671 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 14:47:15,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:15" (1/1) ... [2024-11-19 14:47:15,680 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:15" (1/1) ... [2024-11-19 14:47:15,693 INFO L138 Inliner]: procedures = 10, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2024-11-19 14:47:15,713 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 14:47:15,714 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 14:47:15,714 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 14:47:15,719 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 14:47:15,730 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:15" (1/1) ... [2024-11-19 14:47:15,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:15" (1/1) ... [2024-11-19 14:47:15,731 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:15" (1/1) ... [2024-11-19 14:47:15,739 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]. [2024-11-19 14:47:15,739 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:15" (1/1) ... [2024-11-19 14:47:15,740 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:15" (1/1) ... [2024-11-19 14:47:15,741 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:15" (1/1) ... [2024-11-19 14:47:15,744 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:15" (1/1) ... [2024-11-19 14:47:15,744 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:15" (1/1) ... [2024-11-19 14:47:15,745 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:15" (1/1) ... [2024-11-19 14:47:15,746 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 14:47:15,747 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 14:47:15,747 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 14:47:15,747 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 14:47:15,749 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:15" (1/1) ... [2024-11-19 14:47:15,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:15,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:15,786 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) [2024-11-19 14:47:15,792 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 [2024-11-19 14:47:15,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 14:47:15,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 14:47:15,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 14:47:15,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 14:47:15,893 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 14:47:15,897 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 14:47:15,986 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-11-19 14:47:15,986 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 14:47:16,004 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 14:47:16,004 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 14:47:16,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:47:16 BoogieIcfgContainer [2024-11-19 14:47:16,004 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 14:47:16,005 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 14:47:16,005 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 14:47:16,018 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 14:47:16,018 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:47:16,019 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 02:47:15" (1/3) ... [2024-11-19 14:47:16,019 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@f021b10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:47:16, skipping insertion in model container [2024-11-19 14:47:16,019 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:47:16,019 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:15" (2/3) ... [2024-11-19 14:47:16,020 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@f021b10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:47:16, skipping insertion in model container [2024-11-19 14:47:16,020 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:47:16,020 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:47:16" (3/3) ... [2024-11-19 14:47:16,021 INFO L332 chiAutomizerObserver]: Analyzing ICFG nested_2.c [2024-11-19 14:47:16,137 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 14:47:16,137 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 14:47:16,137 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 14:47:16,138 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 14:47:16,138 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 14:47:16,138 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 14:47:16,138 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 14:47:16,138 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 14:47:16,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:16,155 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-19 14:47:16,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:47:16,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:47:16,160 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:47:16,160 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:47:16,160 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 14:47:16,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:16,161 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-19 14:47:16,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:47:16,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:47:16,162 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:47:16,163 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:47:16,169 INFO L745 eck$LassoCheckResult]: Stem: 8#$Ultimate##0true 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(11, 2);call #Ultimate.allocInit(12, 3); 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_~a~0#1, main_~b~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~a~0#1 := 0; 6#L20-3true [2024-11-19 14:47:16,169 INFO L747 eck$LassoCheckResult]: Loop: 6#L20-3true assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 3#L21-3true assume !(main_~b~0#1 < 6); 7#L20-2true main_#t~pre5#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre5#1; 6#L20-3true [2024-11-19 14:47:16,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:16,175 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-19 14:47:16,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:16,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621382536] [2024-11-19 14:47:16,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:47:16,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:16,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:16,270 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:16,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:16,299 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:16,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:16,302 INFO L85 PathProgramCache]: Analyzing trace with hash 39921, now seen corresponding path program 1 times [2024-11-19 14:47:16,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:16,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329961100] [2024-11-19 14:47:16,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:47:16,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:16,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:16,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:47:16,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:47:16,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329961100] [2024-11-19 14:47:16,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329961100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:47:16,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:47:16,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 14:47:16,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627742960] [2024-11-19 14:47:16,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:47:16,367 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:47:16,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:47:16,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:47:16,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:47:16,395 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:16,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:47:16,419 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2024-11-19 14:47:16,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2024-11-19 14:47:16,421 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-19 14:47:16,423 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 8 states and 9 transitions. [2024-11-19 14:47:16,424 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-19 14:47:16,425 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-19 14:47:16,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2024-11-19 14:47:16,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:47:16,425 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2024-11-19 14:47:16,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2024-11-19 14:47:16,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2024-11-19 14:47:16,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:16,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2024-11-19 14:47:16,444 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2024-11-19 14:47:16,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:47:16,448 INFO L425 stractBuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2024-11-19 14:47:16,449 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 14:47:16,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2024-11-19 14:47:16,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-19 14:47:16,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:47:16,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:47:16,450 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:47:16,450 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-19 14:47:16,451 INFO L745 eck$LassoCheckResult]: Stem: 38#$Ultimate##0 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(11, 2);call #Ultimate.allocInit(12, 3); 39#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_~a~0#1, main_~b~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~a~0#1 := 0; 36#L20-3 [2024-11-19 14:47:16,451 INFO L747 eck$LassoCheckResult]: Loop: 36#L20-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 34#L21-3 assume !!(main_~b~0#1 < 6); 35#L21-2 main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1; 40#L21-3 assume !(main_~b~0#1 < 6); 37#L20-2 main_#t~pre5#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre5#1; 36#L20-3 [2024-11-19 14:47:16,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:16,451 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-19 14:47:16,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:16,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938256178] [2024-11-19 14:47:16,452 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:47:16,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:16,458 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:47:16,459 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:47:16,459 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:16,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:16,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:16,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:16,464 INFO L85 PathProgramCache]: Analyzing trace with hash 38420339, now seen corresponding path program 1 times [2024-11-19 14:47:16,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:16,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118593110] [2024-11-19 14:47:16,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:47:16,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:16,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:47:16,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:47:16,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118593110] [2024-11-19 14:47:16,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118593110] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:47:16,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150729281] [2024-11-19 14:47:16,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:47:16,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:47:16,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:16,495 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) [2024-11-19 14:47:16,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 14:47:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:16,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 14:47:16,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:16,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:47:16,558 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:47:16,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:47:16,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150729281] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:47:16,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:47:16,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-11-19 14:47:16,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920763283] [2024-11-19 14:47:16,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:47:16,578 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:47:16,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:47:16,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 14:47:16,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 14:47:16,579 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:16,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:47:16,611 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2024-11-19 14:47:16,611 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2024-11-19 14:47:16,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2024-11-19 14:47:16,612 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2024-11-19 14:47:16,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-19 14:47:16,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-19 14:47:16,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2024-11-19 14:47:16,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:47:16,617 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-11-19 14:47:16,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2024-11-19 14:47:16,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-19 14:47:16,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:16,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2024-11-19 14:47:16,618 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-11-19 14:47:16,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 14:47:16,619 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-11-19 14:47:16,619 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 14:47:16,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2024-11-19 14:47:16,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2024-11-19 14:47:16,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:47:16,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:47:16,620 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:47:16,620 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 1, 1, 1] [2024-11-19 14:47:16,620 INFO L745 eck$LassoCheckResult]: Stem: 92#$Ultimate##0 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(11, 2);call #Ultimate.allocInit(12, 3); 93#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_~a~0#1, main_~b~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~a~0#1 := 0; 89#L20-3 [2024-11-19 14:47:16,620 INFO L747 eck$LassoCheckResult]: Loop: 89#L20-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 90#L21-3 assume !!(main_~b~0#1 < 6); 94#L21-2 main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1; 87#L21-3 assume !!(main_~b~0#1 < 6); 88#L21-2 main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1; 99#L21-3 assume !!(main_~b~0#1 < 6); 98#L21-2 main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1; 97#L21-3 assume !!(main_~b~0#1 < 6); 96#L21-2 main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1; 95#L21-3 assume !(main_~b~0#1 < 6); 91#L20-2 main_#t~pre5#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre5#1; 89#L20-3 [2024-11-19 14:47:16,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:16,624 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-11-19 14:47:16,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:16,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359904485] [2024-11-19 14:47:16,625 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:47:16,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:16,633 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:47:16,633 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:47:16,633 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:16,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:16,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:16,668 INFO L85 PathProgramCache]: Analyzing trace with hash 718182137, now seen corresponding path program 2 times [2024-11-19 14:47:16,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:16,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118105044] [2024-11-19 14:47:16,669 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:47:16,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:16,695 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:47:16,695 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:47:16,829 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:47:16,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:47:16,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118105044] [2024-11-19 14:47:16,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118105044] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:47:16,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305382138] [2024-11-19 14:47:16,830 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:47:16,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:47:16,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:16,835 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:47:16,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 14:47:16,870 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:47:16,870 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:47:16,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:47:16,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:16,890 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:47:16,890 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:47:16,933 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:47:16,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305382138] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:47:16,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:47:16,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2024-11-19 14:47:16,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855036948] [2024-11-19 14:47:16,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:47:16,935 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:47:16,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:47:16,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 14:47:16,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-19 14:47:16,935 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. cyclomatic complexity: 2 Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:16,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:47:16,954 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2024-11-19 14:47:16,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2024-11-19 14:47:16,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-11-19 14:47:16,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2024-11-19 14:47:16,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-11-19 14:47:16,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-11-19 14:47:16,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2024-11-19 14:47:16,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:47:16,956 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-11-19 14:47:16,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2024-11-19 14:47:16,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-19 14:47:16,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:16,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2024-11-19 14:47:16,958 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-11-19 14:47:16,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 14:47:16,959 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-11-19 14:47:16,960 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-19 14:47:16,960 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2024-11-19 14:47:16,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-11-19 14:47:16,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:47:16,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:47:16,961 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:47:16,961 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 1, 1, 1] [2024-11-19 14:47:16,961 INFO L745 eck$LassoCheckResult]: Stem: 193#$Ultimate##0 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(11, 2);call #Ultimate.allocInit(12, 3); 194#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_~a~0#1, main_~b~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~a~0#1 := 0; 190#L20-3 [2024-11-19 14:47:16,961 INFO L747 eck$LassoCheckResult]: Loop: 190#L20-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 191#L21-3 assume !!(main_~b~0#1 < 6); 195#L21-2 main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1; 188#L21-3 assume !!(main_~b~0#1 < 6); 189#L21-2 main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1; 204#L21-3 assume !!(main_~b~0#1 < 6); 203#L21-2 main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1; 202#L21-3 assume !!(main_~b~0#1 < 6); 201#L21-2 main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1; 200#L21-3 assume !!(main_~b~0#1 < 6); 199#L21-2 main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1; 198#L21-3 assume !!(main_~b~0#1 < 6); 197#L21-2 main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1; 196#L21-3 assume !(main_~b~0#1 < 6); 192#L20-2 main_#t~pre5#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre5#1; 190#L20-3 [2024-11-19 14:47:16,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:16,961 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-11-19 14:47:16,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:16,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672881030] [2024-11-19 14:47:16,962 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:47:16,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:16,966 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:47:16,966 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:47:16,966 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:16,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:16,969 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:16,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:16,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1719812477, now seen corresponding path program 3 times [2024-11-19 14:47:16,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:16,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523880205] [2024-11-19 14:47:16,970 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:47:16,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:16,980 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-11-19 14:47:16,980 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:47:16,980 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:16,988 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:16,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:16,988 INFO L85 PathProgramCache]: Analyzing trace with hash 212205947, now seen corresponding path program 1 times [2024-11-19 14:47:16,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:16,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300216497] [2024-11-19 14:47:16,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:47:16,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:16,996 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:17,003 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:17,079 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:47:17,080 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:47:17,080 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:47:17,080 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:47:17,080 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:47:17,083 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:17,083 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:47:17,083 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:47:17,083 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_2.c_Iteration4_Loop [2024-11-19 14:47:17,083 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:47:17,083 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:47:17,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:17,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:17,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:17,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:17,174 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:47:17,175 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:47:17,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:17,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:17,180 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) [2024-11-19 14:47:17,188 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 [2024-11-19 14:47:17,192 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:47:17,192 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:47:17,222 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 [2024-11-19 14:47:17,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:17,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:17,224 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) [2024-11-19 14:47:17,225 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 [2024-11-19 14:47:17,226 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:47:17,226 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:47:17,252 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:47:17,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-19 14:47:17,258 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:47:17,258 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:47:17,258 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:47:17,258 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:47:17,258 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:47:17,258 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:17,258 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:47:17,258 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:47:17,258 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_2.c_Iteration4_Loop [2024-11-19 14:47:17,258 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:47:17,259 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:47:17,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:17,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:17,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:17,274 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:17,332 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:47:17,335 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:47:17,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:17,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:17,339 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) [2024-11-19 14:47:17,343 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 [2024-11-19 14:47:17,344 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 [2024-11-19 14:47:17,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:47:17,358 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:47:17,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:47:17,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:47:17,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:47:17,361 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:47:17,361 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:47:17,363 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:47:17,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-11-19 14:47:17,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:17,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:17,381 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) [2024-11-19 14:47:17,383 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 [2024-11-19 14:47:17,383 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 [2024-11-19 14:47:17,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:47:17,394 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:47:17,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:47:17,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:47:17,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:47:17,395 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:47:17,396 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:47:17,398 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:47:17,406 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:47:17,407 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:47:17,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:17,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:17,409 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) [2024-11-19 14:47:17,413 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 [2024-11-19 14:47:17,414 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:47:17,414 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:47:17,415 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:47:17,415 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~a~0#1) = -2*ULTIMATE.start_main_~a~0#1 + 11 Supporting invariants [] [2024-11-19 14:47:17,426 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 [2024-11-19 14:47:17,428 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:47:17,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:17,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:47:17,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:17,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:47:17,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:17,533 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-19 14:47:17,535 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:47:17,537 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 18 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:17,562 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 18 transitions. cyclomatic complexity: 2. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 32 states and 35 transitions. Complement of second has 4 states. [2024-11-19 14:47:17,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 14:47:17,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:17,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2024-11-19 14:47:17,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 2 letters. Loop has 15 letters. [2024-11-19 14:47:17,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:47:17,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 17 letters. Loop has 15 letters. [2024-11-19 14:47:17,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:47:17,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 2 letters. Loop has 30 letters. [2024-11-19 14:47:17,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:47:17,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 35 transitions. [2024-11-19 14:47:17,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:47:17,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 31 states and 34 transitions. [2024-11-19 14:47:17,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-11-19 14:47:17,568 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-11-19 14:47:17,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 34 transitions. [2024-11-19 14:47:17,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:47:17,568 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 34 transitions. [2024-11-19 14:47:17,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 34 transitions. [2024-11-19 14:47:17,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 20. [2024-11-19 14:47:17,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:17,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2024-11-19 14:47:17,570 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-11-19 14:47:17,570 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-11-19 14:47:17,570 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-19 14:47:17,571 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2024-11-19 14:47:17,571 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:47:17,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:47:17,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:47:17,571 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-19 14:47:17,571 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:47:17,571 INFO L745 eck$LassoCheckResult]: Stem: 314#$Ultimate##0 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(11, 2);call #Ultimate.allocInit(12, 3); 315#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_~a~0#1, main_~b~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~a~0#1 := 0; 311#L20-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 307#L21-3 [2024-11-19 14:47:17,571 INFO L747 eck$LassoCheckResult]: Loop: 307#L21-3 assume !!(main_~b~0#1 < 6); 308#L21-2 main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1; 307#L21-3 [2024-11-19 14:47:17,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:17,572 INFO L85 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2024-11-19 14:47:17,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:17,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434095458] [2024-11-19 14:47:17,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:47:17,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:17,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:17,577 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:17,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:17,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:17,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:17,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1539, now seen corresponding path program 1 times [2024-11-19 14:47:17,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:17,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321217191] [2024-11-19 14:47:17,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:47:17,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:17,587 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:17,588 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:17,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:17,589 INFO L85 PathProgramCache]: Analyzing trace with hash 28698921, now seen corresponding path program 1 times [2024-11-19 14:47:17,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:17,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154601547] [2024-11-19 14:47:17,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:47:17,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:17,593 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:17,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:17,607 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:47:17,608 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:47:17,608 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:47:17,608 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:47:17,608 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:47:17,608 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:17,608 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:47:17,608 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:47:17,608 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_2.c_Iteration5_Loop [2024-11-19 14:47:17,608 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:47:17,608 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:47:17,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:17,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:17,627 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:47:17,627 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:47:17,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:17,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:17,632 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) [2024-11-19 14:47:17,633 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 [2024-11-19 14:47:17,634 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:47:17,634 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:47:17,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-11-19 14:47:17,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:17,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:17,658 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) [2024-11-19 14:47:17,659 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 [2024-11-19 14:47:17,660 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:47:17,661 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:47:17,687 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:47:17,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-19 14:47:17,692 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:47:17,692 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:47:17,692 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:47:17,692 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:47:17,692 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:47:17,692 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:17,692 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:47:17,692 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:47:17,693 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_2.c_Iteration5_Loop [2024-11-19 14:47:17,693 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:47:17,693 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:47:17,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:17,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:17,713 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:47:17,713 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:47:17,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:17,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:17,715 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) [2024-11-19 14:47:17,720 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 [2024-11-19 14:47:17,720 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 [2024-11-19 14:47:17,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:47:17,730 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:47:17,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:47:17,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:47:17,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:47:17,731 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:47:17,731 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:47:17,734 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:47:17,746 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 [2024-11-19 14:47:17,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:17,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:17,747 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) [2024-11-19 14:47:17,749 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 [2024-11-19 14:47:17,751 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 [2024-11-19 14:47:17,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:47:17,761 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:47:17,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:47:17,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:47:17,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:47:17,762 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:47:17,762 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:47:17,763 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:47:17,766 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:47:17,766 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:47:17,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:17,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:17,768 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) [2024-11-19 14:47:17,775 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 [2024-11-19 14:47:17,776 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:47:17,776 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:47:17,776 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:47:17,776 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~b~0#1) = -2*ULTIMATE.start_main_~b~0#1 + 11 Supporting invariants [] [2024-11-19 14:47:17,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-11-19 14:47:17,796 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:47:17,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:17,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:47:17,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:17,830 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:47:17,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:17,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:47:17,843 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:47:17,843 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:17,862 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 47 states and 54 transitions. Complement of second has 7 states. [2024-11-19 14:47:17,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-19 14:47:17,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:17,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2024-11-19 14:47:17,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 3 letters. Loop has 2 letters. [2024-11-19 14:47:17,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:47:17,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. [2024-11-19 14:47:17,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:47:17,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 3 letters. Loop has 4 letters. [2024-11-19 14:47:17,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:47:17,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 54 transitions. [2024-11-19 14:47:17,867 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:47:17,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 35 states and 39 transitions. [2024-11-19 14:47:17,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-19 14:47:17,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-11-19 14:47:17,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 39 transitions. [2024-11-19 14:47:17,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:47:17,870 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-11-19 14:47:17,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 39 transitions. [2024-11-19 14:47:17,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2024-11-19 14:47:17,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.1) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:17,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2024-11-19 14:47:17,872 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-11-19 14:47:17,872 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-11-19 14:47:17,872 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-19 14:47:17,872 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2024-11-19 14:47:17,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:47:17,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:47:17,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:47:17,873 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 2, 1, 1, 1, 1] [2024-11-19 14:47:17,873 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:47:17,875 INFO L745 eck$LassoCheckResult]: Stem: 420#$Ultimate##0 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(11, 2);call #Ultimate.allocInit(12, 3); 421#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_~a~0#1, main_~b~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~a~0#1 := 0; 418#L20-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 419#L21-3 assume !!(main_~b~0#1 < 6); 422#L21-2 main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1; 414#L21-3 assume !!(main_~b~0#1 < 6); 415#L21-2 main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1; 431#L21-3 assume !!(main_~b~0#1 < 6); 430#L21-2 main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1; 429#L21-3 assume !!(main_~b~0#1 < 6); 428#L21-2 main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1; 427#L21-3 assume !!(main_~b~0#1 < 6); 426#L21-2 main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1; 425#L21-3 assume !!(main_~b~0#1 < 6); 424#L21-2 main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1; 423#L21-3 assume !(main_~b~0#1 < 6); 416#L20-2 main_#t~pre5#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre5#1; 417#L20-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 412#L21-3 [2024-11-19 14:47:17,875 INFO L747 eck$LassoCheckResult]: Loop: 412#L21-3 assume !!(main_~b~0#1 < 6); 413#L21-2 main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1; 412#L21-3 [2024-11-19 14:47:17,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:17,876 INFO L85 PathProgramCache]: Analyzing trace with hash -2011550225, now seen corresponding path program 2 times [2024-11-19 14:47:17,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:17,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179918829] [2024-11-19 14:47:17,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:47:17,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:17,888 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:47:17,888 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:47:17,888 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:17,902 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:17,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:17,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1539, now seen corresponding path program 2 times [2024-11-19 14:47:17,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:17,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089353283] [2024-11-19 14:47:17,903 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:47:17,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:17,909 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:47:17,909 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:47:17,909 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:17,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:17,913 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:17,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:17,913 INFO L85 PathProgramCache]: Analyzing trace with hash -364482447, now seen corresponding path program 3 times [2024-11-19 14:47:17,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:17,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426582746] [2024-11-19 14:47:17,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:47:17,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:17,929 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-11-19 14:47:17,930 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:47:17,930 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:17,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:17,959 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:47:17,959 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:47:17,959 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:47:17,959 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:47:17,959 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:47:17,959 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:17,959 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:47:17,959 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:47:17,959 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_2.c_Iteration6_Loop [2024-11-19 14:47:17,959 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:47:17,959 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:47:17,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:17,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:17,980 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:47:17,980 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:47:17,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:17,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:17,985 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) [2024-11-19 14:47:17,989 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 [2024-11-19 14:47:17,990 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:47:17,990 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:47:18,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-19 14:47:18,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:18,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:18,015 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) [2024-11-19 14:47:18,016 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 [2024-11-19 14:47:18,017 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:47:18,017 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:47:18,044 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:47:18,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-19 14:47:18,051 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:47:18,051 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:47:18,051 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:47:18,051 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:47:18,051 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:47:18,051 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:18,051 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:47:18,051 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:47:18,051 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_2.c_Iteration6_Loop [2024-11-19 14:47:18,051 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:47:18,051 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:47:18,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:18,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:47:18,075 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:47:18,076 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:47:18,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:18,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:18,078 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) [2024-11-19 14:47:18,086 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 [2024-11-19 14:47:18,087 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 [2024-11-19 14:47:18,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:47:18,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:47:18,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:47:18,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:47:18,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:47:18,100 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:47:18,100 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:47:18,102 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:47:18,104 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:47:18,104 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:47:18,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:18,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:18,106 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) [2024-11-19 14:47:18,107 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 [2024-11-19 14:47:18,108 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:47:18,108 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:47:18,108 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:47:18,108 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~b~0#1) = -2*ULTIMATE.start_main_~b~0#1 + 11 Supporting invariants [] [2024-11-19 14:47:18,118 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 [2024-11-19 14:47:18,119 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:47:18,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:18,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:47:18,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:18,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:18,181 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:47:18,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:18,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:47:18,195 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:47:18,195 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:18,208 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 43 states and 48 transitions. Complement of second has 7 states. [2024-11-19 14:47:18,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-19 14:47:18,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:18,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2024-11-19 14:47:18,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 18 letters. Loop has 2 letters. [2024-11-19 14:47:18,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:47:18,209 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:47:18,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:18,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:47:18,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:18,278 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:47:18,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:18,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:47:18,308 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:47:18,309 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:18,340 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 43 states and 48 transitions. Complement of second has 7 states. [2024-11-19 14:47:18,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-19 14:47:18,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:18,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2024-11-19 14:47:18,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 18 letters. Loop has 2 letters. [2024-11-19 14:47:18,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:47:18,342 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:47:18,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:18,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:47:18,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:18,437 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:47:18,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:18,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:47:18,451 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:47:18,451 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:18,476 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 30 states and 34 transitions. Complement of second has 6 states. [2024-11-19 14:47:18,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-19 14:47:18,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:18,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2024-11-19 14:47:18,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 18 letters. Loop has 2 letters. [2024-11-19 14:47:18,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:47:18,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 20 letters. Loop has 2 letters. [2024-11-19 14:47:18,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:47:18,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 18 letters. Loop has 4 letters. [2024-11-19 14:47:18,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:47:18,478 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 34 transitions. [2024-11-19 14:47:18,478 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-19 14:47:18,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 0 states and 0 transitions. [2024-11-19 14:47:18,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-19 14:47:18,478 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-19 14:47:18,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-19 14:47:18,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:47:18,479 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:47:18,479 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:47:18,479 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:47:18,479 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-19 14:47:18,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-19 14:47:18,479 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-19 14:47:18,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-19 14:47:18,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 02:47:18 BoogieIcfgContainer [2024-11-19 14:47:18,485 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-19 14:47:18,485 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 14:47:18,485 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 14:47:18,485 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 14:47:18,486 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:47:16" (3/4) ... [2024-11-19 14:47:18,487 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 14:47:18,488 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 14:47:18,489 INFO L158 Benchmark]: Toolchain (without parser) took 3012.56ms. Allocated memory was 167.8MB in the beginning and 264.2MB in the end (delta: 96.5MB). Free memory was 94.5MB in the beginning and 109.9MB in the end (delta: -15.4MB). Peak memory consumption was 81.3MB. Max. memory is 16.1GB. [2024-11-19 14:47:18,489 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 167.8MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:47:18,489 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.26ms. Allocated memory is still 167.8MB. Free memory was 94.2MB in the beginning and 82.4MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 14:47:18,489 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.85ms. Allocated memory is still 167.8MB. Free memory was 82.4MB in the beginning and 138.2MB in the end (delta: -55.8MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2024-11-19 14:47:18,489 INFO L158 Benchmark]: Boogie Preprocessor took 32.19ms. Allocated memory is still 167.8MB. Free memory was 138.2MB in the beginning and 136.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:47:18,489 INFO L158 Benchmark]: RCFGBuilder took 257.47ms. Allocated memory was 167.8MB in the beginning and 264.2MB in the end (delta: 96.5MB). Free memory was 136.5MB in the beginning and 227.7MB in the end (delta: -91.2MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2024-11-19 14:47:18,490 INFO L158 Benchmark]: BuchiAutomizer took 2479.80ms. Allocated memory is still 264.2MB. Free memory was 227.7MB in the beginning and 109.9MB in the end (delta: 117.8MB). Peak memory consumption was 116.7MB. Max. memory is 16.1GB. [2024-11-19 14:47:18,490 INFO L158 Benchmark]: Witness Printer took 2.89ms. Allocated memory is still 264.2MB. Free memory is still 109.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:47:18,491 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.16ms. Allocated memory is still 167.8MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 193.26ms. Allocated memory is still 167.8MB. Free memory was 94.2MB in the beginning and 82.4MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.85ms. Allocated memory is still 167.8MB. Free memory was 82.4MB in the beginning and 138.2MB in the end (delta: -55.8MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.19ms. Allocated memory is still 167.8MB. Free memory was 138.2MB in the beginning and 136.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 257.47ms. Allocated memory was 167.8MB in the beginning and 264.2MB in the end (delta: 96.5MB). Free memory was 136.5MB in the beginning and 227.7MB in the end (delta: -91.2MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * BuchiAutomizer took 2479.80ms. Allocated memory is still 264.2MB. Free memory was 227.7MB in the beginning and 109.9MB in the end (delta: 117.8MB). Peak memory consumption was 116.7MB. Max. memory is 16.1GB. * Witness Printer took 2.89ms. Allocated memory is still 264.2MB. Free memory is still 109.9MB. 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 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function (((long long) -2 * a) + 11) and consists of 3 locations. One deterministic module has affine ranking function (((long long) -2 * b) + 11) and consists of 4 locations. One nondeterministic module has affine ranking function (((long long) -2 * b) + 11) and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.3s and 7 iterations. TraceHistogramMax:6. Analysis of lassos took 1.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 27 StatesRemovedByMinimization, 3 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 [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 36/36 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 45 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 70 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 68 IncrementalHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 49 mSDtfsCounter, 68 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital11 mio100 ax100 hnf100 lsp92 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-19 14:47:18,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-19 14:47:18,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-19 14:47:18,914 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 [2024-11-19 14:47:19,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 14:47:19,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 14:47:19,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE