./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 c7c6ca5d 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-?-c7c6ca5-m [2024-11-09 15:52:25,960 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 15:52:26,020 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-09 15:52:26,027 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 15:52:26,028 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 15:52:26,057 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 15:52:26,058 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 15:52:26,058 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 15:52:26,059 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 15:52:26,061 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 15:52:26,061 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 15:52:26,062 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 15:52:26,062 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 15:52:26,065 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 15:52:26,066 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 15:52:26,066 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 15:52:26,066 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 15:52:26,066 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 15:52:26,066 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 15:52:26,067 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 15:52:26,067 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 15:52:26,069 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 15:52:26,069 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 15:52:26,069 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 15:52:26,070 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 15:52:26,070 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 15:52:26,070 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 15:52:26,070 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 15:52:26,071 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 15:52:26,071 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 15:52:26,071 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 15:52:26,071 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 15:52:26,072 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 15:52:26,072 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 15:52:26,072 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 15:52:26,072 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 15:52:26,073 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 15:52:26,073 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 15:52:26,074 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 15:52:26,074 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-09 15:52:26,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 15:52:26,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 15:52:26,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 15:52:26,350 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 15:52:26,350 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 15:52:26,351 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-09 15:52:27,872 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 15:52:28,047 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 15:52:28,048 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_2.c [2024-11-09 15:52:28,054 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8224cf805/01b87b6c08484f278b2c560bf58c6aba/FLAG5ebe7dce7 [2024-11-09 15:52:28,064 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8224cf805/01b87b6c08484f278b2c560bf58c6aba [2024-11-09 15:52:28,066 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 15:52:28,067 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 15:52:28,069 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 15:52:28,070 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 15:52:28,076 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 15:52:28,076 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:52:28" (1/1) ... [2024-11-09 15:52:28,077 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a98e25e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:52:28, skipping insertion in model container [2024-11-09 15:52:28,077 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:52:28" (1/1) ... [2024-11-09 15:52:28,091 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 15:52:28,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:52:28,292 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 15:52:28,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:52:28,316 INFO L204 MainTranslator]: Completed translation [2024-11-09 15:52:28,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:52:28 WrapperNode [2024-11-09 15:52:28,317 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 15:52:28,318 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 15:52:28,318 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 15:52:28,319 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 15:52:28,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:52:28" (1/1) ... [2024-11-09 15:52:28,331 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:52:28" (1/1) ... [2024-11-09 15:52:28,348 INFO L138 Inliner]: procedures = 10, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2024-11-09 15:52:28,349 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 15:52:28,349 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 15:52:28,349 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 15:52:28,350 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 15:52:28,359 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:52:28" (1/1) ... [2024-11-09 15:52:28,360 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:52:28" (1/1) ... [2024-11-09 15:52:28,361 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:52:28" (1/1) ... [2024-11-09 15:52:28,371 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-09 15:52:28,372 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:52:28" (1/1) ... [2024-11-09 15:52:28,372 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:52:28" (1/1) ... [2024-11-09 15:52:28,374 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:52:28" (1/1) ... [2024-11-09 15:52:28,377 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:52:28" (1/1) ... [2024-11-09 15:52:28,378 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:52:28" (1/1) ... [2024-11-09 15:52:28,378 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:52:28" (1/1) ... [2024-11-09 15:52:28,379 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 15:52:28,380 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 15:52:28,380 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 15:52:28,380 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 15:52:28,381 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:52:28" (1/1) ... [2024-11-09 15:52:28,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:28,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:28,414 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-09 15:52:28,421 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-09 15:52:28,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 15:52:28,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 15:52:28,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 15:52:28,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 15:52:28,512 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 15:52:28,514 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 15:52:28,588 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-11-09 15:52:28,589 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 15:52:28,597 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 15:52:28,597 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 15:52:28,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:52:28 BoogieIcfgContainer [2024-11-09 15:52:28,598 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 15:52:28,599 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 15:52:28,599 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 15:52:28,602 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 15:52:28,603 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:52:28,603 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 03:52:28" (1/3) ... [2024-11-09 15:52:28,604 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f5c546a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:52:28, skipping insertion in model container [2024-11-09 15:52:28,605 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:52:28,605 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:52:28" (2/3) ... [2024-11-09 15:52:28,606 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f5c546a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:52:28, skipping insertion in model container [2024-11-09 15:52:28,606 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:52:28,606 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:52:28" (3/3) ... [2024-11-09 15:52:28,607 INFO L332 chiAutomizerObserver]: Analyzing ICFG nested_2.c [2024-11-09 15:52:28,668 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 15:52:28,668 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 15:52:28,669 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 15:52:28,669 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 15:52:28,669 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 15:52:28,669 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 15:52:28,669 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 15:52:28,669 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 15:52:28,673 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-09 15:52:28,686 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-09 15:52:28,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:52:28,687 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:52:28,691 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:52:28,692 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-09 15:52:28,692 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 15:52:28,692 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-09 15:52:28,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-09 15:52:28,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:52:28,694 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:52:28,694 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:52:28,694 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-09 15:52:28,704 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-09 15:52:28,705 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-09 15:52:28,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:28,710 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-09 15:52:28,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:52:28,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526112234] [2024-11-09 15:52:28,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:52:28,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:52:28,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:28,795 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:52:28,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:28,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:52:28,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:28,828 INFO L85 PathProgramCache]: Analyzing trace with hash 39921, now seen corresponding path program 1 times [2024-11-09 15:52:28,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:52:28,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546695135] [2024-11-09 15:52:28,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:52:28,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:52:28,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:52:28,907 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-09 15:52:28,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:52:28,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546695135] [2024-11-09 15:52:28,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546695135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:52:28,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:52:28,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 15:52:28,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614931090] [2024-11-09 15:52:28,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:52:28,913 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:52:28,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:52:28,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:52:28,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:52:28,953 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-09 15:52:28,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:52:28,980 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2024-11-09 15:52:28,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2024-11-09 15:52:28,982 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-09 15:52:28,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 8 states and 9 transitions. [2024-11-09 15:52:28,986 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-09 15:52:28,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-09 15:52:28,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2024-11-09 15:52:28,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:52:28,987 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2024-11-09 15:52:28,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2024-11-09 15:52:29,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2024-11-09 15:52:29,005 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-09 15:52:29,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2024-11-09 15:52:29,006 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2024-11-09 15:52:29,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:52:29,011 INFO L425 stractBuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2024-11-09 15:52:29,011 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 15:52:29,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2024-11-09 15:52:29,012 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-09 15:52:29,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:52:29,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:52:29,012 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:52:29,012 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-09 15:52:29,012 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-09 15:52:29,013 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-09 15:52:29,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:29,013 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-09 15:52:29,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:52:29,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438727642] [2024-11-09 15:52:29,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:52:29,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:52:29,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:29,022 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:52:29,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:29,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:52:29,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:29,033 INFO L85 PathProgramCache]: Analyzing trace with hash 38420339, now seen corresponding path program 1 times [2024-11-09 15:52:29,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:52:29,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79426395] [2024-11-09 15:52:29,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:52:29,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:52:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:52:29,080 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-09 15:52:29,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:52:29,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79426395] [2024-11-09 15:52:29,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79426395] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:52:29,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465310071] [2024-11-09 15:52:29,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:52:29,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:52:29,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:29,084 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-09 15:52:29,085 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-09 15:52:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:52:29,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 15:52:29,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:52:29,153 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-09 15:52:29,153 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:52:29,198 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-09 15:52:29,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465310071] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:52:29,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:52:29,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-11-09 15:52:29,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41663100] [2024-11-09 15:52:29,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:52:29,200 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:52:29,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:52:29,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 15:52:29,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 15:52:29,201 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-09 15:52:29,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:52:29,234 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2024-11-09 15:52:29,234 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2024-11-09 15:52:29,235 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2024-11-09 15:52:29,235 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2024-11-09 15:52:29,236 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-09 15:52:29,236 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-09 15:52:29,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2024-11-09 15:52:29,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:52:29,236 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-11-09 15:52:29,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2024-11-09 15:52:29,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-09 15:52:29,238 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-09 15:52:29,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2024-11-09 15:52:29,238 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-11-09 15:52:29,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 15:52:29,240 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-11-09 15:52:29,240 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-09 15:52:29,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2024-11-09 15:52:29,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2024-11-09 15:52:29,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:52:29,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:52:29,241 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:52:29,241 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 1, 1, 1] [2024-11-09 15:52:29,241 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-09 15:52:29,242 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-09 15:52:29,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:29,242 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-11-09 15:52:29,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:52:29,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153848775] [2024-11-09 15:52:29,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:52:29,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:52:29,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:29,250 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:52:29,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:29,264 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:52:29,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:29,265 INFO L85 PathProgramCache]: Analyzing trace with hash 718182137, now seen corresponding path program 2 times [2024-11-09 15:52:29,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:52:29,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625474456] [2024-11-09 15:52:29,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:52:29,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:52:29,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:52:29,371 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-09 15:52:29,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:52:29,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625474456] [2024-11-09 15:52:29,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625474456] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:52:29,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863583652] [2024-11-09 15:52:29,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:52:29,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:52:29,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:29,397 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-09 15:52:29,399 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-09 15:52:29,433 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 15:52:29,433 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:52:29,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:52:29,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:52:29,477 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-09 15:52:29,478 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:52:29,553 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-09 15:52:29,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863583652] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:52:29,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:52:29,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2024-11-09 15:52:29,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263860875] [2024-11-09 15:52:29,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:52:29,554 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:52:29,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:52:29,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 15:52:29,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-09 15:52:29,556 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-09 15:52:29,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:52:29,592 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2024-11-09 15:52:29,592 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2024-11-09 15:52:29,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-11-09 15:52:29,593 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2024-11-09 15:52:29,593 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-11-09 15:52:29,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-11-09 15:52:29,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2024-11-09 15:52:29,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:52:29,594 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-11-09 15:52:29,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2024-11-09 15:52:29,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-09 15:52:29,595 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-09 15:52:29,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2024-11-09 15:52:29,597 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-11-09 15:52:29,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 15:52:29,598 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-11-09 15:52:29,599 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-09 15:52:29,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2024-11-09 15:52:29,600 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-11-09 15:52:29,600 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:52:29,600 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:52:29,600 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:52:29,601 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 1, 1, 1] [2024-11-09 15:52:29,601 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-09 15:52:29,601 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-09 15:52:29,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:29,601 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-11-09 15:52:29,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:52:29,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181522420] [2024-11-09 15:52:29,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:52:29,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:52:29,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:29,614 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:52:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:29,619 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:52:29,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:29,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1719812477, now seen corresponding path program 3 times [2024-11-09 15:52:29,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:52:29,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50226992] [2024-11-09 15:52:29,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:52:29,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:52:29,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:29,639 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:52:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:29,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:52:29,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:29,657 INFO L85 PathProgramCache]: Analyzing trace with hash 212205947, now seen corresponding path program 1 times [2024-11-09 15:52:29,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:52:29,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901233622] [2024-11-09 15:52:29,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:52:29,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:52:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:29,676 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:52:29,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:29,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:52:29,843 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:52:29,844 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:52:29,844 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:52:29,844 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:52:29,844 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:52:29,844 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:29,844 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:52:29,844 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:52:29,844 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_2.c_Iteration4_Loop [2024-11-09 15:52:29,845 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:52:29,845 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:52:29,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:29,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:29,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:29,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:29,919 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:52:29,920 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:52:29,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:29,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:29,930 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-09 15:52:29,932 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-09 15:52:29,933 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:52:29,933 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:52:29,964 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-09 15:52:29,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:29,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:29,967 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-09 15:52:29,968 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-09 15:52:29,969 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:52:29,970 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:52:30,006 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:52:30,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-09 15:52:30,013 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:52:30,013 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:52:30,013 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:52:30,013 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:52:30,013 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:52:30,013 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:30,013 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:52:30,013 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:52:30,013 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_2.c_Iteration4_Loop [2024-11-09 15:52:30,014 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:52:30,014 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:52:30,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:30,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:30,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:30,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:30,070 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:52:30,075 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:52:30,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:30,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:30,080 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-09 15:52:30,081 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-09 15:52:30,083 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-09 15:52:30,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:52:30,096 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:52:30,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:52:30,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:52:30,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:52:30,099 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:52:30,099 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:52:30,102 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:52:30,113 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-09 15:52:30,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:30,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:30,114 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-09 15:52:30,116 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-09 15:52:30,116 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-09 15:52:30,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:52:30,131 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:52:30,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:52:30,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:52:30,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:52:30,132 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:52:30,132 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:52:30,135 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:52:30,143 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 15:52:30,143 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-09 15:52:30,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:30,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:30,152 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-09 15:52:30,162 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:52:30,162 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:52:30,162 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:52:30,163 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-09 15:52:30,166 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-09 15:52:30,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-11-09 15:52:30,180 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:52:30,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:52:30,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:52:30,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:52:30,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:52:30,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:52:30,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:52:30,350 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-09 15:52:30,356 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-09 15:52:30,359 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-09 15:52:30,395 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-09 15:52:30,397 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-09 15:52:30,398 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-09 15:52:30,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2024-11-09 15:52:30,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 2 letters. Loop has 15 letters. [2024-11-09 15:52:30,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:52:30,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 17 letters. Loop has 15 letters. [2024-11-09 15:52:30,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:52:30,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 2 letters. Loop has 30 letters. [2024-11-09 15:52:30,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:52:30,405 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 35 transitions. [2024-11-09 15:52:30,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:52:30,407 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 31 states and 34 transitions. [2024-11-09 15:52:30,407 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-11-09 15:52:30,407 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-11-09 15:52:30,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 34 transitions. [2024-11-09 15:52:30,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:52:30,408 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 34 transitions. [2024-11-09 15:52:30,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 34 transitions. [2024-11-09 15:52:30,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 20. [2024-11-09 15:52:30,410 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-09 15:52:30,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2024-11-09 15:52:30,410 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-11-09 15:52:30,410 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-11-09 15:52:30,410 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-09 15:52:30,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2024-11-09 15:52:30,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:52:30,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:52:30,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:52:30,411 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 15:52:30,411 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:52:30,412 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-09 15:52:30,412 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-09 15:52:30,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:30,412 INFO L85 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2024-11-09 15:52:30,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:52:30,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93617798] [2024-11-09 15:52:30,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:52:30,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:52:30,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:30,417 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:52:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:30,421 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:52:30,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:30,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1539, now seen corresponding path program 1 times [2024-11-09 15:52:30,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:52:30,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58000387] [2024-11-09 15:52:30,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:52:30,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:52:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:30,429 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:52:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:30,432 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:52:30,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:30,436 INFO L85 PathProgramCache]: Analyzing trace with hash 28698921, now seen corresponding path program 1 times [2024-11-09 15:52:30,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:52:30,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526974694] [2024-11-09 15:52:30,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:52:30,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:52:30,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:30,442 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:52:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:30,450 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:52:30,465 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:52:30,466 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:52:30,466 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:52:30,466 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:52:30,466 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:52:30,466 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:30,466 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:52:30,466 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:52:30,466 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_2.c_Iteration5_Loop [2024-11-09 15:52:30,466 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:52:30,466 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:52:30,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:30,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:30,492 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:52:30,492 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:52:30,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:30,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:30,494 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-09 15:52:30,497 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-09 15:52:30,498 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:52:30,498 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:52:30,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-09 15:52:30,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:30,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:30,530 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-09 15:52:30,531 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-09 15:52:30,532 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:52:30,532 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:52:30,564 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:52:30,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-11-09 15:52:30,569 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:52:30,569 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:52:30,570 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:52:30,570 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:52:30,570 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:52:30,570 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:30,570 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:52:30,570 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:52:30,570 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_2.c_Iteration5_Loop [2024-11-09 15:52:30,570 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:52:30,570 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:52:30,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:30,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:30,598 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:52:30,598 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:52:30,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:30,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:30,600 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-09 15:52:30,602 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-09 15:52:30,603 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-09 15:52:30,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:52:30,615 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:52:30,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:52:30,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:52:30,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:52:30,616 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:52:30,616 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:52:30,618 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:52:30,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-09 15:52:30,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:30,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:30,636 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-09 15:52:30,637 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-09 15:52:30,638 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-09 15:52:30,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:52:30,651 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:52:30,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:52:30,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:52:30,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:52:30,653 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:52:30,653 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:52:30,655 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:52:30,658 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 15:52:30,658 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-09 15:52:30,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:30,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:30,661 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-09 15:52:30,663 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-09 15:52:30,664 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:52:30,664 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:52:30,664 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:52:30,665 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-09 15:52:30,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-09 15:52:30,681 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:52:30,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:30,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:52:30,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:52:30,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:52:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:52:30,711 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:52:30,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:52:30,725 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-09 15:52:30,726 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-09 15:52:30,726 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-09 15:52:30,751 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-09 15:52:30,753 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-09 15:52:30,754 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-09 15:52:30,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2024-11-09 15:52:30,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 3 letters. Loop has 2 letters. [2024-11-09 15:52:30,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:52:30,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. [2024-11-09 15:52:30,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:52:30,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 3 letters. Loop has 4 letters. [2024-11-09 15:52:30,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:52:30,755 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 54 transitions. [2024-11-09 15:52:30,757 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:52:30,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 35 states and 39 transitions. [2024-11-09 15:52:30,761 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-09 15:52:30,761 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-11-09 15:52:30,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 39 transitions. [2024-11-09 15:52:30,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:52:30,762 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-11-09 15:52:30,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 39 transitions. [2024-11-09 15:52:30,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2024-11-09 15:52:30,763 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-09 15:52:30,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2024-11-09 15:52:30,763 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-11-09 15:52:30,763 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-11-09 15:52:30,764 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-09 15:52:30,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2024-11-09 15:52:30,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:52:30,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:52:30,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:52:30,769 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 2, 1, 1, 1, 1] [2024-11-09 15:52:30,769 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:52:30,769 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-09 15:52:30,769 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-09 15:52:30,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:30,770 INFO L85 PathProgramCache]: Analyzing trace with hash -2011550225, now seen corresponding path program 2 times [2024-11-09 15:52:30,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:52:30,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970075798] [2024-11-09 15:52:30,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:52:30,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:52:30,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:30,786 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:52:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:30,801 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:52:30,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:30,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1539, now seen corresponding path program 2 times [2024-11-09 15:52:30,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:52:30,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197711433] [2024-11-09 15:52:30,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:52:30,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:52:30,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:30,811 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:52:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:30,815 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:52:30,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:30,819 INFO L85 PathProgramCache]: Analyzing trace with hash -364482447, now seen corresponding path program 3 times [2024-11-09 15:52:30,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:52:30,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368789691] [2024-11-09 15:52:30,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:52:30,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:52:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:30,837 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:52:30,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:30,850 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:52:30,872 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:52:30,872 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:52:30,872 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:52:30,872 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:52:30,872 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:52:30,872 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:30,872 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:52:30,872 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:52:30,872 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_2.c_Iteration6_Loop [2024-11-09 15:52:30,872 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:52:30,873 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:52:30,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:30,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:30,899 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:52:30,899 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:52:30,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:30,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:30,901 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-09 15:52:30,903 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-09 15:52:30,904 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:52:30,904 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:52:30,934 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-09 15:52:30,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:30,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:30,935 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-09 15:52:30,936 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-09 15:52:30,937 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:52:30,937 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:52:30,969 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:52:30,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-09 15:52:30,975 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:52:30,976 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:52:30,976 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:52:30,976 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:52:30,976 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:52:30,976 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:30,976 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:52:30,976 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:52:30,976 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_2.c_Iteration6_Loop [2024-11-09 15:52:30,976 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:52:30,976 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:52:30,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:30,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:31,006 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:52:31,007 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:52:31,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:31,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:31,009 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-09 15:52:31,011 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-09 15:52:31,012 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-09 15:52:31,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:52:31,026 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:52:31,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:52:31,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:52:31,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:52:31,027 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:52:31,028 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:52:31,033 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:52:31,036 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 15:52:31,036 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-09 15:52:31,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:31,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:31,038 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-09 15:52:31,040 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-09 15:52:31,041 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:52:31,041 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:52:31,041 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:52:31,041 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-09 15:52:31,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-09 15:52:31,058 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:52:31,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:31,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:52:31,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:52:31,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:52:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:52:31,121 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:52:31,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:52:31,135 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-09 15:52:31,135 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-09 15:52:31,136 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-09 15:52:31,154 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-09 15:52:31,155 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-09 15:52:31,156 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-09 15:52:31,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2024-11-09 15:52:31,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 18 letters. Loop has 2 letters. [2024-11-09 15:52:31,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:52:31,156 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:52:31,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:52:31,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:52:31,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:52:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:52:31,208 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:52:31,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:52:31,223 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-09 15:52:31,224 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-09 15:52:31,224 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-09 15:52:31,246 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-09 15:52:31,247 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-09 15:52:31,247 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-09 15:52:31,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2024-11-09 15:52:31,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 18 letters. Loop has 2 letters. [2024-11-09 15:52:31,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:52:31,248 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:52:31,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:52:31,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:52:31,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:52:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:52:31,300 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:52:31,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:52:31,320 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-09 15:52:31,322 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-09 15:52:31,322 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-09 15:52:31,352 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-09 15:52:31,353 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-09 15:52:31,354 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-09 15:52:31,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2024-11-09 15:52:31,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 18 letters. Loop has 2 letters. [2024-11-09 15:52:31,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:52:31,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 20 letters. Loop has 2 letters. [2024-11-09 15:52:31,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:52:31,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 18 letters. Loop has 4 letters. [2024-11-09 15:52:31,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:52:31,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 34 transitions. [2024-11-09 15:52:31,358 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-09 15:52:31,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 0 states and 0 transitions. [2024-11-09 15:52:31,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-09 15:52:31,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-09 15:52:31,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-09 15:52:31,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:52:31,360 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:52:31,361 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:52:31,361 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:52:31,361 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-09 15:52:31,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-09 15:52:31,361 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-09 15:52:31,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-09 15:52:31,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 03:52:31 BoogieIcfgContainer [2024-11-09 15:52:31,373 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-09 15:52:31,374 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 15:52:31,374 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 15:52:31,374 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 15:52:31,374 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:52:28" (3/4) ... [2024-11-09 15:52:31,376 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 15:52:31,379 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 15:52:31,380 INFO L158 Benchmark]: Toolchain (without parser) took 3312.76ms. Allocated memory was 142.6MB in the beginning and 180.4MB in the end (delta: 37.7MB). Free memory was 71.0MB in the beginning and 56.8MB in the end (delta: 14.2MB). Peak memory consumption was 51.6MB. Max. memory is 16.1GB. [2024-11-09 15:52:31,380 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 142.6MB. Free memory is still 94.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:52:31,381 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.94ms. Allocated memory was 142.6MB in the beginning and 180.4MB in the end (delta: 37.7MB). Free memory was 70.7MB in the beginning and 149.6MB in the end (delta: -78.8MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2024-11-09 15:52:31,381 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.49ms. Allocated memory is still 180.4MB. Free memory was 149.6MB in the beginning and 148.6MB in the end (delta: 965.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:52:31,382 INFO L158 Benchmark]: Boogie Preprocessor took 30.11ms. Allocated memory is still 180.4MB. Free memory was 148.6MB in the beginning and 146.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:52:31,382 INFO L158 Benchmark]: RCFGBuilder took 217.46ms. Allocated memory is still 180.4MB. Free memory was 146.5MB in the beginning and 137.1MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 15:52:31,383 INFO L158 Benchmark]: BuchiAutomizer took 2774.35ms. Allocated memory is still 180.4MB. Free memory was 137.1MB in the beginning and 56.8MB in the end (delta: 80.2MB). Peak memory consumption was 78.1MB. Max. memory is 16.1GB. [2024-11-09 15:52:31,384 INFO L158 Benchmark]: Witness Printer took 5.74ms. Allocated memory is still 180.4MB. Free memory is still 56.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:52:31,386 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.20ms. Allocated memory is still 142.6MB. Free memory is still 94.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.94ms. Allocated memory was 142.6MB in the beginning and 180.4MB in the end (delta: 37.7MB). Free memory was 70.7MB in the beginning and 149.6MB in the end (delta: -78.8MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.49ms. Allocated memory is still 180.4MB. Free memory was 149.6MB in the beginning and 148.6MB in the end (delta: 965.0kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.11ms. Allocated memory is still 180.4MB. Free memory was 148.6MB in the beginning and 146.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 217.46ms. Allocated memory is still 180.4MB. Free memory was 146.5MB in the beginning and 137.1MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 2774.35ms. Allocated memory is still 180.4MB. Free memory was 137.1MB in the beginning and 56.8MB in the end (delta: 80.2MB). Peak memory consumption was 78.1MB. Max. memory is 16.1GB. * Witness Printer took 5.74ms. Allocated memory is still 180.4MB. Free memory is still 56.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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.7s and 7 iterations. TraceHistogramMax:6. Analysis of lassos took 1.8s. Construction of modules took 0.1s. 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-09 15:52:31,417 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-09 15:52:31,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-09 15:52:31,607 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-09 15:52:31,811 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-09 15:52:32,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 15:52:32,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE