./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-12 00:46:43,955 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:46:44,010 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-12 00:46:44,016 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:46:44,017 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:46:44,043 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:46:44,044 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:46:44,044 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:46:44,045 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:46:44,047 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:46:44,048 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:46:44,048 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:46:44,048 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:46:44,049 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:46:44,049 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:46:44,049 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:46:44,049 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:46:44,051 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:46:44,051 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:46:44,051 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:46:44,051 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:46:44,052 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 00:46:44,052 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:46:44,052 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 00:46:44,053 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:46:44,053 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:46:44,053 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:46:44,053 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:46:44,054 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:46:44,054 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:46:44,054 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 00:46:44,054 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:46:44,054 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:46:44,055 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:46:44,055 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:46:44,055 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:46:44,056 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:46:44,056 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:46:44,056 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:46:44,057 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-clean/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-clean/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-10-12 00:46:44,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:46:44,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:46:44,306 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:46:44,307 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:46:44,308 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:46:44,309 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_2.c [2024-10-12 00:46:45,630 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:46:45,784 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:46:45,785 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_2.c [2024-10-12 00:46:45,792 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bb2de7da5/0fc0b9eff979439cb4deb7924f226784/FLAGc8e7931cb [2024-10-12 00:46:46,205 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bb2de7da5/0fc0b9eff979439cb4deb7924f226784 [2024-10-12 00:46:46,208 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:46:46,209 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:46:46,213 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:46:46,213 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:46:46,219 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:46:46,221 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:46:46" (1/1) ... [2024-10-12 00:46:46,222 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@430cb205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:46, skipping insertion in model container [2024-10-12 00:46:46,222 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:46:46" (1/1) ... [2024-10-12 00:46:46,237 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:46:46,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:46:46,378 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:46:46,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:46:46,400 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:46:46,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:46 WrapperNode [2024-10-12 00:46:46,401 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:46:46,402 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:46:46,402 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:46:46,402 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:46:46,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:46" (1/1) ... [2024-10-12 00:46:46,412 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:46" (1/1) ... [2024-10-12 00:46:46,423 INFO L138 Inliner]: procedures = 10, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2024-10-12 00:46:46,423 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:46:46,424 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:46:46,424 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:46:46,424 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:46:46,432 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:46" (1/1) ... [2024-10-12 00:46:46,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:46" (1/1) ... [2024-10-12 00:46:46,433 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:46" (1/1) ... [2024-10-12 00:46:46,440 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-10-12 00:46:46,441 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:46" (1/1) ... [2024-10-12 00:46:46,441 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:46" (1/1) ... [2024-10-12 00:46:46,443 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:46" (1/1) ... [2024-10-12 00:46:46,445 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:46" (1/1) ... [2024-10-12 00:46:46,445 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:46" (1/1) ... [2024-10-12 00:46:46,446 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:46" (1/1) ... [2024-10-12 00:46:46,447 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:46:46,447 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:46:46,448 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:46:46,448 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:46:46,448 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:46" (1/1) ... [2024-10-12 00:46:46,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:46,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:46,503 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:46,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 00:46:46,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 00:46:46,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:46:46,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:46:46,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 00:46:46,615 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:46:46,617 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:46:46,695 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-10-12 00:46:46,696 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:46:46,705 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:46:46,705 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 00:46:46,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:46:46 BoogieIcfgContainer [2024-10-12 00:46:46,706 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:46:46,706 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:46:46,706 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:46:46,714 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:46:46,714 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:46:46,716 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 12:46:46" (1/3) ... [2024-10-12 00:46:46,716 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e6e6344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:46:46, skipping insertion in model container [2024-10-12 00:46:46,716 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:46:46,716 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:46:46" (2/3) ... [2024-10-12 00:46:46,717 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e6e6344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:46:46, skipping insertion in model container [2024-10-12 00:46:46,721 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:46:46,721 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:46:46" (3/3) ... [2024-10-12 00:46:46,723 INFO L332 chiAutomizerObserver]: Analyzing ICFG nested_2.c [2024-10-12 00:46:46,804 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:46:46,805 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:46:46,805 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:46:46,805 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:46:46,805 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:46:46,805 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:46:46,805 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:46:46,805 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:46:46,809 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-10-12 00:46:46,821 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-12 00:46:46,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:46:46,821 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:46:46,825 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:46:46,825 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:46:46,825 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:46:46,826 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-10-12 00:46:46,826 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-12 00:46:46,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:46:46,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:46:46,827 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:46:46,827 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:46:46,833 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-10-12 00:46:46,833 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-10-12 00:46:46,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:46,838 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-12 00:46:46,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:46,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462292089] [2024-10-12 00:46:46,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:46,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:46,924 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:46,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:46,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:46,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:46,954 INFO L85 PathProgramCache]: Analyzing trace with hash 39921, now seen corresponding path program 1 times [2024-10-12 00:46:46,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:46,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273962786] [2024-10-12 00:46:46,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:46,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:47,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:46:47,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:46:47,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273962786] [2024-10-12 00:46:47,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273962786] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:46:47,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:46:47,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 00:46:47,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576933129] [2024-10-12 00:46:47,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:46:47,020 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:46:47,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:46:47,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:46:47,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:46:47,052 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-10-12 00:46:47,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:46:47,075 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2024-10-12 00:46:47,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2024-10-12 00:46:47,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-12 00:46:47,083 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 8 states and 9 transitions. [2024-10-12 00:46:47,085 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-10-12 00:46:47,086 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-10-12 00:46:47,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2024-10-12 00:46:47,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:46:47,086 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2024-10-12 00:46:47,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2024-10-12 00:46:47,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2024-10-12 00:46:47,105 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-10-12 00:46:47,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2024-10-12 00:46:47,106 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2024-10-12 00:46:47,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:46:47,110 INFO L425 stractBuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2024-10-12 00:46:47,110 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:46:47,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2024-10-12 00:46:47,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-12 00:46:47,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:46:47,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:46:47,111 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:46:47,111 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-12 00:46:47,111 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-10-12 00:46:47,112 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-10-12 00:46:47,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:47,113 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-10-12 00:46:47,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:47,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219976207] [2024-10-12 00:46:47,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:47,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:47,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:47,123 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:47,133 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:47,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:47,136 INFO L85 PathProgramCache]: Analyzing trace with hash 38420339, now seen corresponding path program 1 times [2024-10-12 00:46:47,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:47,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919315062] [2024-10-12 00:46:47,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:47,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:47,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:47,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:46:47,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:46:47,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919315062] [2024-10-12 00:46:47,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919315062] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:46:47,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402023838] [2024-10-12 00:46:47,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:47,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:46:47,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:47,180 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:46:47,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 00:46:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:47,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 00:46:47,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:47,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:46:47,289 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:46:47,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:46:47,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402023838] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:46:47,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:46:47,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-10-12 00:46:47,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422902693] [2024-10-12 00:46:47,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:46:47,319 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:46:47,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:46:47,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 00:46:47,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-12 00:46:47,320 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-10-12 00:46:47,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:46:47,340 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2024-10-12 00:46:47,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2024-10-12 00:46:47,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2024-10-12 00:46:47,342 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2024-10-12 00:46:47,342 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-10-12 00:46:47,342 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-10-12 00:46:47,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2024-10-12 00:46:47,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:46:47,343 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-10-12 00:46:47,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2024-10-12 00:46:47,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-10-12 00:46:47,344 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-10-12 00:46:47,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2024-10-12 00:46:47,344 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-10-12 00:46:47,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 00:46:47,345 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-10-12 00:46:47,346 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:46:47,346 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2024-10-12 00:46:47,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2024-10-12 00:46:47,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:46:47,346 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:46:47,347 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:46:47,347 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 1, 1, 1] [2024-10-12 00:46:47,347 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-10-12 00:46:47,347 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-10-12 00:46:47,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:47,348 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-10-12 00:46:47,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:47,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613387699] [2024-10-12 00:46:47,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:47,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:47,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:47,354 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:47,358 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:47,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:47,359 INFO L85 PathProgramCache]: Analyzing trace with hash 718182137, now seen corresponding path program 2 times [2024-10-12 00:46:47,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:47,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555701760] [2024-10-12 00:46:47,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:47,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:47,430 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:46:47,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:46:47,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555701760] [2024-10-12 00:46:47,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555701760] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:46:47,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190917996] [2024-10-12 00:46:47,432 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:46:47,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:46:47,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:47,454 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:46:47,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 00:46:47,484 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 00:46:47,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:46:47,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:46:47,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:47,505 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:46:47,505 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:46:47,550 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:46:47,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190917996] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:46:47,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:46:47,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2024-10-12 00:46:47,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258953356] [2024-10-12 00:46:47,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:46:47,551 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:46:47,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:46:47,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 00:46:47,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-10-12 00:46:47,552 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-10-12 00:46:47,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:46:47,572 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2024-10-12 00:46:47,572 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2024-10-12 00:46:47,573 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-10-12 00:46:47,574 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2024-10-12 00:46:47,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-10-12 00:46:47,575 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-10-12 00:46:47,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2024-10-12 00:46:47,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:46:47,576 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-10-12 00:46:47,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2024-10-12 00:46:47,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-10-12 00:46:47,578 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-10-12 00:46:47,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2024-10-12 00:46:47,579 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-10-12 00:46:47,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 00:46:47,580 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-10-12 00:46:47,580 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 00:46:47,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2024-10-12 00:46:47,581 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-10-12 00:46:47,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:46:47,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:46:47,582 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:46:47,582 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 1, 1, 1] [2024-10-12 00:46:47,583 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-10-12 00:46:47,583 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-10-12 00:46:47,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:47,583 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-10-12 00:46:47,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:47,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625644863] [2024-10-12 00:46:47,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:47,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:47,596 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:47,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:47,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:47,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1719812477, now seen corresponding path program 3 times [2024-10-12 00:46:47,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:47,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964041649] [2024-10-12 00:46:47,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:47,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:47,615 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:47,629 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:47,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:47,631 INFO L85 PathProgramCache]: Analyzing trace with hash 212205947, now seen corresponding path program 1 times [2024-10-12 00:46:47,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:47,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146928564] [2024-10-12 00:46:47,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:47,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:47,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:47,647 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:47,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:47,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:47,755 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:46:47,756 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:46:47,756 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:46:47,756 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:46:47,756 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:46:47,757 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:47,757 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:46:47,757 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:46:47,757 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_2.c_Iteration4_Loop [2024-10-12 00:46:47,758 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:46:47,758 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:46:47,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:47,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:47,785 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:47,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:47,820 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:46:47,821 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:46:47,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:47,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:47,830 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:47,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-12 00:46:47,834 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:46:47,834 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:46:47,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-12 00:46:47,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:47,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:47,860 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:47,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-12 00:46:47,864 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:46:47,864 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:46:47,897 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:46:47,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-12 00:46:47,909 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:46:47,909 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:46:47,909 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:46:47,909 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:46:47,909 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:46:47,909 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:47,910 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:46:47,910 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:46:47,910 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_2.c_Iteration4_Loop [2024-10-12 00:46:47,910 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:46:47,910 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:46:47,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:47,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:47,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:47,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:47,956 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:46:47,960 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:46:47,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:47,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:47,965 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:47,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-12 00:46:47,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:46:47,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:46:47,982 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:46:47,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:46:47,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:46:47,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:46:47,984 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:46:47,984 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:46:47,986 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:46:47,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-10-12 00:46:47,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:47,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:48,001 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:48,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-12 00:46:48,011 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-10-12 00:46:48,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:46:48,022 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:46:48,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:46:48,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:46:48,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:46:48,023 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:46:48,024 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:46:48,026 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:46:48,031 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:46:48,031 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:46:48,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:48,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:48,036 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:48,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-12 00:46:48,039 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:46:48,039 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:46:48,039 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:46:48,040 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-10-12 00:46:48,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-10-12 00:46:48,053 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:46:48,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:48,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:48,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:46:48,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:48,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:46:48,106 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:48,178 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-12 00:46:48,181 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-10-12 00:46:48,182 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-10-12 00:46:48,210 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-10-12 00:46:48,211 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-10-12 00:46:48,212 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-10-12 00:46:48,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2024-10-12 00:46:48,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 2 letters. Loop has 15 letters. [2024-10-12 00:46:48,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:48,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 17 letters. Loop has 15 letters. [2024-10-12 00:46:48,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:48,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 2 letters. Loop has 30 letters. [2024-10-12 00:46:48,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:48,216 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 35 transitions. [2024-10-12 00:46:48,217 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:46:48,218 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 31 states and 34 transitions. [2024-10-12 00:46:48,218 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-10-12 00:46:48,218 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-10-12 00:46:48,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 34 transitions. [2024-10-12 00:46:48,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:46:48,218 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 34 transitions. [2024-10-12 00:46:48,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 34 transitions. [2024-10-12 00:46:48,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 20. [2024-10-12 00:46:48,220 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-10-12 00:46:48,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2024-10-12 00:46:48,220 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-10-12 00:46:48,221 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-10-12 00:46:48,221 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 00:46:48,221 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2024-10-12 00:46:48,221 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:46:48,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:46:48,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:46:48,221 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-12 00:46:48,221 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:46:48,222 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-10-12 00:46:48,222 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-10-12 00:46:48,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:48,222 INFO L85 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2024-10-12 00:46:48,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:48,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835948248] [2024-10-12 00:46:48,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:48,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:48,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:48,227 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:48,230 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:48,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:48,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1539, now seen corresponding path program 1 times [2024-10-12 00:46:48,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:48,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320803931] [2024-10-12 00:46:48,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:48,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:48,234 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:48,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:48,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:48,236 INFO L85 PathProgramCache]: Analyzing trace with hash 28698921, now seen corresponding path program 1 times [2024-10-12 00:46:48,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:48,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24251560] [2024-10-12 00:46:48,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:48,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:48,241 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:48,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:48,258 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:46:48,258 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:46:48,258 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:46:48,258 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:46:48,259 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:46:48,259 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:48,259 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:46:48,259 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:46:48,259 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_2.c_Iteration5_Loop [2024-10-12 00:46:48,259 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:46:48,259 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:46:48,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:48,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:48,280 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:46:48,280 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:46:48,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:48,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:48,282 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:48,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-12 00:46:48,291 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:46:48,291 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:46:48,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-12 00:46:48,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:48,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:48,315 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:48,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-12 00:46:48,318 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:46:48,318 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:46:48,348 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:46:48,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-10-12 00:46:48,354 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:46:48,354 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:46:48,354 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:46:48,354 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:46:48,354 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:46:48,354 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:48,354 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:46:48,354 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:46:48,355 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_2.c_Iteration5_Loop [2024-10-12 00:46:48,355 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:46:48,355 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:46:48,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:48,360 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:48,379 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:46:48,379 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:46:48,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:48,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:48,380 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:48,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-12 00:46:48,386 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-10-12 00:46:48,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:46:48,397 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:46:48,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:46:48,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:46:48,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:46:48,398 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:46:48,398 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:46:48,399 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:46:48,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-10-12 00:46:48,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:48,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:48,413 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:48,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-12 00:46:48,417 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-10-12 00:46:48,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:46:48,427 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:46:48,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:46:48,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:46:48,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:46:48,428 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:46:48,428 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:46:48,432 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:46:48,435 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:46:48,435 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:46:48,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:48,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:48,437 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:48,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-12 00:46:48,439 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:46:48,439 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:46:48,439 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:46:48,440 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-10-12 00:46:48,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-10-12 00:46:48,452 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:46:48,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:48,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:46:48,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:48,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:48,482 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:46:48,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:48,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:46:48,502 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-10-12 00:46:48,502 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-10-12 00:46:48,516 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-10-12 00:46:48,517 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-10-12 00:46:48,517 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-10-12 00:46:48,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2024-10-12 00:46:48,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 3 letters. Loop has 2 letters. [2024-10-12 00:46:48,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:48,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. [2024-10-12 00:46:48,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:48,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 3 letters. Loop has 4 letters. [2024-10-12 00:46:48,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:48,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 54 transitions. [2024-10-12 00:46:48,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:46:48,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 35 states and 39 transitions. [2024-10-12 00:46:48,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-10-12 00:46:48,520 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-10-12 00:46:48,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 39 transitions. [2024-10-12 00:46:48,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:46:48,521 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-10-12 00:46:48,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 39 transitions. [2024-10-12 00:46:48,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2024-10-12 00:46:48,522 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-10-12 00:46:48,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2024-10-12 00:46:48,522 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-10-12 00:46:48,522 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-10-12 00:46:48,522 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-12 00:46:48,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2024-10-12 00:46:48,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:46:48,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:46:48,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:46:48,523 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 2, 1, 1, 1, 1] [2024-10-12 00:46:48,523 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:46:48,524 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-10-12 00:46:48,524 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-10-12 00:46:48,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:48,524 INFO L85 PathProgramCache]: Analyzing trace with hash -2011550225, now seen corresponding path program 2 times [2024-10-12 00:46:48,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:48,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234107500] [2024-10-12 00:46:48,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:48,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:48,535 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:48,549 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:48,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:48,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1539, now seen corresponding path program 2 times [2024-10-12 00:46:48,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:48,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046316363] [2024-10-12 00:46:48,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:48,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:48,555 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:48,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:48,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:48,559 INFO L85 PathProgramCache]: Analyzing trace with hash -364482447, now seen corresponding path program 3 times [2024-10-12 00:46:48,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:46:48,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792971735] [2024-10-12 00:46:48,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:46:48,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:46:48,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:48,569 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:46:48,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:46:48,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:46:48,596 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:46:48,596 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:46:48,596 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:46:48,597 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:46:48,597 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:46:48,597 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:48,597 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:46:48,597 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:46:48,597 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_2.c_Iteration6_Loop [2024-10-12 00:46:48,597 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:46:48,597 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:46:48,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:48,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:48,628 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:46:48,628 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:46:48,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:48,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:48,630 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:48,634 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:46:48,635 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:46:48,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-12 00:46:48,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-10-12 00:46:48,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:48,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:48,660 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:48,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-12 00:46:48,662 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:46:48,663 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:46:48,693 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:46:48,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-12 00:46:48,699 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:46:48,699 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:46:48,699 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:46:48,699 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:46:48,699 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:46:48,699 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:48,699 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:46:48,699 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:46:48,699 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_2.c_Iteration6_Loop [2024-10-12 00:46:48,699 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:46:48,699 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:46:48,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:48,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:46:48,720 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:46:48,721 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:46:48,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:48,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:48,722 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:48,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-12 00:46:48,724 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-10-12 00:46:48,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:46:48,735 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:46:48,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:46:48,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:46:48,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:46:48,736 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:46:48,736 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:46:48,738 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:46:48,740 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:46:48,740 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:46:48,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:46:48,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:46:48,744 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:46:48,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-12 00:46:48,746 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:46:48,746 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:46:48,746 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:46:48,746 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-10-12 00:46:48,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-10-12 00:46:48,758 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:46:48,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:48,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:46:48,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:48,800 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:46:48,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:48,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:46:48,811 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-10-12 00:46:48,811 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-10-12 00:46:48,827 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-10-12 00:46:48,827 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-10-12 00:46:48,828 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-10-12 00:46:48,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2024-10-12 00:46:48,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 18 letters. Loop has 2 letters. [2024-10-12 00:46:48,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:48,828 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:46:48,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:48,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:46:48,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:48,870 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:46:48,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:48,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:46:48,888 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-10-12 00:46:48,888 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-10-12 00:46:48,912 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-10-12 00:46:48,913 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-10-12 00:46:48,914 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-10-12 00:46:48,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2024-10-12 00:46:48,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 18 letters. Loop has 2 letters. [2024-10-12 00:46:48,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:48,914 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:46:48,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:46:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:48,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:46:48,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:48,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-12 00:46:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:46:48,996 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:46:48,996 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:46:49,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-10-12 00:46:49,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:46:49,016 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-10-12 00:46:49,016 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-10-12 00:46:49,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-12 00:46:49,039 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-10-12 00:46:49,040 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-10-12 00:46:49,040 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-10-12 00:46:49,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2024-10-12 00:46:49,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 18 letters. Loop has 2 letters. [2024-10-12 00:46:49,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:49,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 20 letters. Loop has 2 letters. [2024-10-12 00:46:49,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:49,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 18 letters. Loop has 4 letters. [2024-10-12 00:46:49,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:46:49,042 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 34 transitions. [2024-10-12 00:46:49,042 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:46:49,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 0 states and 0 transitions. [2024-10-12 00:46:49,042 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-12 00:46:49,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-12 00:46:49,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-12 00:46:49,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:46:49,043 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:46:49,043 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:46:49,043 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:46:49,043 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-12 00:46:49,043 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-12 00:46:49,043 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:46:49,043 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-12 00:46:49,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 12:46:49 BoogieIcfgContainer [2024-10-12 00:46:49,050 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-12 00:46:49,050 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 00:46:49,050 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 00:46:49,050 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 00:46:49,051 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:46:46" (3/4) ... [2024-10-12 00:46:49,052 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 00:46:49,053 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 00:46:49,054 INFO L158 Benchmark]: Toolchain (without parser) took 2844.14ms. Allocated memory was 167.8MB in the beginning and 241.2MB in the end (delta: 73.4MB). Free memory was 97.1MB in the beginning and 200.0MB in the end (delta: -102.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:46:49,054 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 121.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:46:49,054 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.31ms. Allocated memory is still 167.8MB. Free memory was 97.0MB in the beginning and 85.6MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 00:46:49,054 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.93ms. Allocated memory is still 167.8MB. Free memory was 85.4MB in the beginning and 84.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:46:49,055 INFO L158 Benchmark]: Boogie Preprocessor took 22.92ms. Allocated memory is still 167.8MB. Free memory was 84.1MB in the beginning and 82.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:46:49,055 INFO L158 Benchmark]: RCFGBuilder took 258.18ms. Allocated memory is still 167.8MB. Free memory was 82.4MB in the beginning and 132.8MB in the end (delta: -50.4MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2024-10-12 00:46:49,056 INFO L158 Benchmark]: BuchiAutomizer took 2343.41ms. Allocated memory was 167.8MB in the beginning and 241.2MB in the end (delta: 73.4MB). Free memory was 131.8MB in the beginning and 200.0MB in the end (delta: -68.3MB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB. [2024-10-12 00:46:49,056 INFO L158 Benchmark]: Witness Printer took 2.89ms. Allocated memory is still 241.2MB. Free memory is still 200.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:46:49,057 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.15ms. Allocated memory is still 167.8MB. Free memory is still 121.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 188.31ms. Allocated memory is still 167.8MB. Free memory was 97.0MB in the beginning and 85.6MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.93ms. Allocated memory is still 167.8MB. Free memory was 85.4MB in the beginning and 84.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.92ms. Allocated memory is still 167.8MB. Free memory was 84.1MB in the beginning and 82.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 258.18ms. Allocated memory is still 167.8MB. Free memory was 82.4MB in the beginning and 132.8MB in the end (delta: -50.4MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 2343.41ms. Allocated memory was 167.8MB in the beginning and 241.2MB in the end (delta: 73.4MB). Free memory was 131.8MB in the beginning and 200.0MB in the end (delta: -68.3MB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB. * Witness Printer took 2.89ms. Allocated memory is still 241.2MB. Free memory is still 200.0MB. 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.2s and 7 iterations. TraceHistogramMax:6. Analysis of lassos took 1.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. 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: 24ms 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-10-12 00:46:49,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 00:46:49,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 00:46:49,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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