./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-simple/nested_3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loop-simple/nested_3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6a30debb45adf4eb2040807436dec0136066a492a6c11eb0dbebd1f179f328d9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-23 02:38:41,091 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 02:38:41,137 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-23 02:38:41,140 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 02:38:41,140 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 02:38:41,155 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 02:38:41,155 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 02:38:41,156 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 02:38:41,156 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 02:38:41,156 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 02:38:41,157 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 02:38:41,157 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 02:38:41,157 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 02:38:41,157 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-23 02:38:41,158 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-23 02:38:41,158 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-23 02:38:41,158 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-23 02:38:41,158 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-23 02:38:41,159 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-23 02:38:41,159 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 02:38:41,159 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-23 02:38:41,160 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 02:38:41,160 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 02:38:41,160 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 02:38:41,160 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 02:38:41,161 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-23 02:38:41,161 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-23 02:38:41,161 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-23 02:38:41,161 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-23 02:38:41,161 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-23 02:38:41,162 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 02:38:41,162 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 02:38:41,162 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-23 02:38:41,162 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 02:38:41,162 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 02:38:41,163 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 02:38:41,163 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 02:38:41,163 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 02:38:41,163 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-23 02:38:41,164 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6a30debb45adf4eb2040807436dec0136066a492a6c11eb0dbebd1f179f328d9 [2024-11-23 02:38:41,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 02:38:41,424 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 02:38:41,427 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 02:38:41,428 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 02:38:41,429 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 02:38:41,430 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-simple/nested_3.c [2024-11-23 02:38:42,954 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-23 02:38:43,173 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 02:38:43,174 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_3.c [2024-11-23 02:38:43,180 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c38be9fe0/ef82cecb0392431399a2501ca0a2f406/FLAG605c9e843 [2024-11-23 02:38:43,192 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c38be9fe0/ef82cecb0392431399a2501ca0a2f406 [2024-11-23 02:38:43,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 02:38:43,195 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 02:38:43,196 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 02:38:43,196 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 02:38:43,200 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 02:38:43,201 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:38:43" (1/1) ... [2024-11-23 02:38:43,202 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16230d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:43, skipping insertion in model container [2024-11-23 02:38:43,202 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:38:43" (1/1) ... [2024-11-23 02:38:43,216 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 02:38:43,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 02:38:43,390 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 02:38:43,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 02:38:43,416 INFO L204 MainTranslator]: Completed translation [2024-11-23 02:38:43,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:43 WrapperNode [2024-11-23 02:38:43,416 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 02:38:43,417 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 02:38:43,417 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 02:38:43,417 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 02:38:43,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:43" (1/1) ... [2024-11-23 02:38:43,428 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:43" (1/1) ... [2024-11-23 02:38:43,486 INFO L138 Inliner]: procedures = 10, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 41 [2024-11-23 02:38:43,487 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 02:38:43,487 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 02:38:43,487 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 02:38:43,487 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 02:38:43,497 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:43" (1/1) ... [2024-11-23 02:38:43,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:43" (1/1) ... [2024-11-23 02:38:43,502 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:43" (1/1) ... [2024-11-23 02:38:43,548 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-23 02:38:43,548 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:43" (1/1) ... [2024-11-23 02:38:43,548 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:43" (1/1) ... [2024-11-23 02:38:43,556 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:43" (1/1) ... [2024-11-23 02:38:43,561 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:43" (1/1) ... [2024-11-23 02:38:43,563 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:43" (1/1) ... [2024-11-23 02:38:43,563 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:43" (1/1) ... [2024-11-23 02:38:43,565 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 02:38:43,570 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 02:38:43,570 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 02:38:43,570 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 02:38:43,571 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:43" (1/1) ... [2024-11-23 02:38:43,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:43,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:43,602 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:43,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-23 02:38:43,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 02:38:43,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 02:38:43,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 02:38:43,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-23 02:38:43,706 INFO L238 CfgBuilder]: Building ICFG [2024-11-23 02:38:43,709 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 02:38:43,840 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-23 02:38:43,841 INFO L287 CfgBuilder]: Performing block encoding [2024-11-23 02:38:43,856 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 02:38:43,857 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-23 02:38:43,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:38:43 BoogieIcfgContainer [2024-11-23 02:38:43,857 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 02:38:43,858 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-23 02:38:43,858 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-23 02:38:43,865 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-23 02:38:43,866 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:38:43,866 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 02:38:43" (1/3) ... [2024-11-23 02:38:43,867 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7bb4b57a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:38:43, skipping insertion in model container [2024-11-23 02:38:43,867 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:38:43,867 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:38:43" (2/3) ... [2024-11-23 02:38:43,867 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7bb4b57a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:38:43, skipping insertion in model container [2024-11-23 02:38:43,867 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:38:43,868 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:38:43" (3/3) ... [2024-11-23 02:38:43,871 INFO L332 chiAutomizerObserver]: Analyzing ICFG nested_3.c [2024-11-23 02:38:43,932 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-23 02:38:43,932 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-23 02:38:43,934 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-23 02:38:43,934 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-23 02:38:43,934 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-23 02:38:43,934 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-23 02:38:43,934 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-23 02:38:43,935 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-23 02:38:43,940 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:43,977 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-23 02:38:43,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:38:43,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:38:43,987 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 02:38:43,988 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:38:43,989 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-23 02:38:43,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:43,994 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-23 02:38:43,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:38:43,994 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:38:43,996 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 02:38:43,996 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:38:44,011 INFO L745 eck$LassoCheckResult]: Stem: 10#$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); 4#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_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 3#L21-3true [2024-11-23 02:38:44,013 INFO L747 eck$LassoCheckResult]: Loop: 3#L21-3true assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 11#L22-3true assume !(main_~b~0#1 < 6); 13#L21-2true main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1; 3#L21-3true [2024-11-23 02:38:44,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:44,027 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-23 02:38:44,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:44,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775494820] [2024-11-23 02:38:44,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:38:44,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:44,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:44,167 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:38:44,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:44,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:38:44,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:44,229 INFO L85 PathProgramCache]: Analyzing trace with hash 39933, now seen corresponding path program 1 times [2024-11-23 02:38:44,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:44,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002886225] [2024-11-23 02:38:44,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:38:44,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:44,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:38:44,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:38:44,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:38:44,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002886225] [2024-11-23 02:38:44,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002886225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:38:44,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:38:44,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 02:38:44,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425897939] [2024-11-23 02:38:44,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:38:44,362 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:38:44,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:38:44,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 02:38:44,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 02:38:44,418 INFO L87 Difference]: Start difference. First operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:44,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:38:44,434 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2024-11-23 02:38:44,435 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2024-11-23 02:38:44,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2024-11-23 02:38:44,438 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 12 states and 15 transitions. [2024-11-23 02:38:44,438 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-23 02:38:44,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-23 02:38:44,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 15 transitions. [2024-11-23 02:38:44,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:38:44,439 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 15 transitions. [2024-11-23 02:38:44,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 15 transitions. [2024-11-23 02:38:44,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 9. [2024-11-23 02:38:44,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:44,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2024-11-23 02:38:44,458 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 11 transitions. [2024-11-23 02:38:44,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 02:38:44,461 INFO L425 stractBuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2024-11-23 02:38:44,462 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-23 02:38:44,462 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2024-11-23 02:38:44,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-23 02:38:44,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:38:44,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:38:44,463 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 02:38:44,463 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-23 02:38:44,463 INFO L745 eck$LassoCheckResult]: Stem: 44#$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); 45#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_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 40#L21-3 [2024-11-23 02:38:44,463 INFO L747 eck$LassoCheckResult]: Loop: 40#L21-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 41#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 43#L23-3 assume !(main_~c~0#1 < 6); 47#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 48#L22-3 assume !(main_~b~0#1 < 6); 46#L21-2 main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1; 40#L21-3 [2024-11-23 02:38:44,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:44,464 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-23 02:38:44,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:44,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705963033] [2024-11-23 02:38:44,464 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:38:44,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:44,470 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:38:44,471 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:38:44,471 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:38:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:44,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:38:44,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:44,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1191164837, now seen corresponding path program 1 times [2024-11-23 02:38:44,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:44,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114592814] [2024-11-23 02:38:44,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:38:44,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:38:44,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:38:44,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:38:44,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114592814] [2024-11-23 02:38:44,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114592814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:38:44,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:38:44,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 02:38:44,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111144758] [2024-11-23 02:38:44,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:38:44,499 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:38:44,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:38:44,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 02:38:44,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 02:38:44,500 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:44,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:38:44,507 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2024-11-23 02:38:44,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2024-11-23 02:38:44,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-23 02:38:44,508 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2024-11-23 02:38:44,508 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-23 02:38:44,509 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-23 02:38:44,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2024-11-23 02:38:44,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:38:44,509 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2024-11-23 02:38:44,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2024-11-23 02:38:44,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2024-11-23 02:38:44,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:44,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2024-11-23 02:38:44,511 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 12 transitions. [2024-11-23 02:38:44,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 02:38:44,511 INFO L425 stractBuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2024-11-23 02:38:44,512 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-23 02:38:44,512 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2024-11-23 02:38:44,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-23 02:38:44,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:38:44,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:38:44,513 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 02:38:44,513 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:38:44,513 INFO L745 eck$LassoCheckResult]: Stem: 70#$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); 71#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_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 66#L21-3 [2024-11-23 02:38:44,513 INFO L747 eck$LassoCheckResult]: Loop: 66#L21-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 67#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 72#L23-3 assume !!(main_~c~0#1 < 6); 68#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 69#L23-3 assume !(main_~c~0#1 < 6); 74#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 75#L22-3 assume !(main_~b~0#1 < 6); 73#L21-2 main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1; 66#L21-3 [2024-11-23 02:38:44,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:44,514 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-11-23 02:38:44,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:44,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117232470] [2024-11-23 02:38:44,514 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:38:44,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:44,519 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-23 02:38:44,519 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:38:44,520 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:38:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:44,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:38:44,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:44,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1993060441, now seen corresponding path program 1 times [2024-11-23 02:38:44,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:44,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454889767] [2024-11-23 02:38:44,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:38:44,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:38:44,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:38:44,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:38:44,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454889767] [2024-11-23 02:38:44,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454889767] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:38:44,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292988579] [2024-11-23 02:38:44,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:38:44,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:38:44,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:44,572 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:38:44,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-23 02:38:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:38:44,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-23 02:38:44,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:38:44,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:38:44,630 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:38:44,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:38:44,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292988579] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:38:44,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:38:44,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-23 02:38:44,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956841326] [2024-11-23 02:38:44,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:38:44,652 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:38:44,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:38:44,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 02:38:44,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-23 02:38:44,653 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 3 Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:44,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:38:44,671 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2024-11-23 02:38:44,671 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 18 transitions. [2024-11-23 02:38:44,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-11-23 02:38:44,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 18 transitions. [2024-11-23 02:38:44,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-11-23 02:38:44,672 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-11-23 02:38:44,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 18 transitions. [2024-11-23 02:38:44,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:38:44,673 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-11-23 02:38:44,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 18 transitions. [2024-11-23 02:38:44,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-23 02:38:44,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:44,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-11-23 02:38:44,674 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-11-23 02:38:44,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 02:38:44,675 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-11-23 02:38:44,675 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-23 02:38:44,675 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2024-11-23 02:38:44,676 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-11-23 02:38:44,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:38:44,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:38:44,676 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 02:38:44,676 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 1, 1, 1, 1, 1, 1] [2024-11-23 02:38:44,676 INFO L745 eck$LassoCheckResult]: Stem: 147#$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); 148#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_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 143#L21-3 [2024-11-23 02:38:44,676 INFO L747 eck$LassoCheckResult]: Loop: 143#L21-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 144#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 149#L23-3 assume !!(main_~c~0#1 < 6); 145#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 146#L23-3 assume !!(main_~c~0#1 < 6); 158#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 157#L23-3 assume !!(main_~c~0#1 < 6); 156#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 155#L23-3 assume !!(main_~c~0#1 < 6); 154#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 153#L23-3 assume !(main_~c~0#1 < 6); 151#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 152#L22-3 assume !(main_~b~0#1 < 6); 150#L21-2 main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1; 143#L21-3 [2024-11-23 02:38:44,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:44,677 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-11-23 02:38:44,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:44,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391095106] [2024-11-23 02:38:44,678 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:38:44,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:44,683 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:38:44,683 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:38:44,683 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:38:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:44,687 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:38:44,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:44,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1917011795, now seen corresponding path program 2 times [2024-11-23 02:38:44,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:44,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244849346] [2024-11-23 02:38:44,688 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:38:44,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:44,695 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:38:44,695 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:38:44,725 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-23 02:38:44,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:38:44,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244849346] [2024-11-23 02:38:44,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244849346] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:38:44,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606873904] [2024-11-23 02:38:44,727 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:38:44,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:38:44,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:44,729 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:38:44,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-23 02:38:44,755 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:38:44,755 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:38:44,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-23 02:38:44,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:38:44,811 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:38:44,812 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:38:44,883 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:38:44,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606873904] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:38:44,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:38:44,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 10 [2024-11-23 02:38:44,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063999171] [2024-11-23 02:38:44,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:38:44,885 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:38:44,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:38:44,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-23 02:38:44,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-23 02:38:44,885 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. cyclomatic complexity: 3 Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:45,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:38:45,061 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2024-11-23 02:38:45,061 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 53 transitions. [2024-11-23 02:38:45,063 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2024-11-23 02:38:45,065 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 53 transitions. [2024-11-23 02:38:45,066 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2024-11-23 02:38:45,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2024-11-23 02:38:45,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 53 transitions. [2024-11-23 02:38:45,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:38:45,068 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 53 transitions. [2024-11-23 02:38:45,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 53 transitions. [2024-11-23 02:38:45,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2024-11-23 02:38:45,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:45,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-11-23 02:38:45,070 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-23 02:38:45,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-23 02:38:45,073 INFO L425 stractBuchiCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-23 02:38:45,073 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-23 02:38:45,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 38 transitions. [2024-11-23 02:38:45,075 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2024-11-23 02:38:45,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:38:45,075 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:38:45,076 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 02:38:45,078 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 2, 2, 2, 1, 1, 1] [2024-11-23 02:38:45,078 INFO L745 eck$LassoCheckResult]: Stem: 327#$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); 328#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_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 323#L21-3 [2024-11-23 02:38:45,078 INFO L747 eck$LassoCheckResult]: Loop: 323#L21-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 324#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 348#L23-3 assume !!(main_~c~0#1 < 6); 347#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 346#L23-3 assume !!(main_~c~0#1 < 6); 345#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 344#L23-3 assume !!(main_~c~0#1 < 6); 343#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 342#L23-3 assume !!(main_~c~0#1 < 6); 341#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 340#L23-3 assume !!(main_~c~0#1 < 6); 339#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 338#L23-3 assume !!(main_~c~0#1 < 6); 337#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 336#L23-3 assume !(main_~c~0#1 < 6); 333#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 330#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 331#L23-3 assume !!(main_~c~0#1 < 6); 325#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 326#L23-3 assume !!(main_~c~0#1 < 6); 329#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 357#L23-3 assume !!(main_~c~0#1 < 6); 356#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 355#L23-3 assume !!(main_~c~0#1 < 6); 354#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 353#L23-3 assume !!(main_~c~0#1 < 6); 352#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 351#L23-3 assume !!(main_~c~0#1 < 6); 350#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 349#L23-3 assume !(main_~c~0#1 < 6); 335#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 334#L22-3 assume !(main_~b~0#1 < 6); 332#L21-2 main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1; 323#L21-3 [2024-11-23 02:38:45,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:45,079 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-11-23 02:38:45,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:45,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831423883] [2024-11-23 02:38:45,079 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-23 02:38:45,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:45,083 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:38:45,084 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:38:45,084 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:38:45,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:45,088 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:38:45,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:45,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1010871677, now seen corresponding path program 3 times [2024-11-23 02:38:45,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:45,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52665500] [2024-11-23 02:38:45,089 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:38:45,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:45,102 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2024-11-23 02:38:45,102 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:38:45,162 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-23 02:38:45,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:38:45,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52665500] [2024-11-23 02:38:45,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52665500] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:38:45,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949326901] [2024-11-23 02:38:45,164 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:38:45,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:38:45,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:45,169 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:38:45,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-23 02:38:45,203 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2024-11-23 02:38:45,204 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:38:45,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:38:45,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:38:45,250 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-23 02:38:45,250 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:38:45,316 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-23 02:38:45,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949326901] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:38:45,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:38:45,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-23 02:38:45,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762417871] [2024-11-23 02:38:45,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:38:45,318 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:38:45,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:38:45,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-23 02:38:45,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-23 02:38:45,318 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. cyclomatic complexity: 4 Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:45,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:38:45,364 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2024-11-23 02:38:45,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 102 transitions. [2024-11-23 02:38:45,365 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2024-11-23 02:38:45,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 95 states and 102 transitions. [2024-11-23 02:38:45,366 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2024-11-23 02:38:45,367 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2024-11-23 02:38:45,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 102 transitions. [2024-11-23 02:38:45,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:38:45,367 INFO L218 hiAutomatonCegarLoop]: Abstraction has 95 states and 102 transitions. [2024-11-23 02:38:45,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 102 transitions. [2024-11-23 02:38:45,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-23 02:38:45,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.0736842105263158) internal successors, (102), 94 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:45,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2024-11-23 02:38:45,372 INFO L240 hiAutomatonCegarLoop]: Abstraction has 95 states and 102 transitions. [2024-11-23 02:38:45,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-23 02:38:45,372 INFO L425 stractBuchiCegarLoop]: Abstraction has 95 states and 102 transitions. [2024-11-23 02:38:45,373 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-23 02:38:45,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 102 transitions. [2024-11-23 02:38:45,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2024-11-23 02:38:45,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:38:45,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:38:45,375 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 02:38:45,375 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [36, 36, 6, 6, 6, 1, 1, 1] [2024-11-23 02:38:45,375 INFO L745 eck$LassoCheckResult]: Stem: 660#$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); 661#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_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 656#L21-3 [2024-11-23 02:38:45,375 INFO L747 eck$LassoCheckResult]: Loop: 656#L21-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 657#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 662#L23-3 assume !!(main_~c~0#1 < 6); 658#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 659#L23-3 assume !!(main_~c~0#1 < 6); 747#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 745#L23-3 assume !!(main_~c~0#1 < 6); 743#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 741#L23-3 assume !!(main_~c~0#1 < 6); 739#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 737#L23-3 assume !!(main_~c~0#1 < 6); 735#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 733#L23-3 assume !!(main_~c~0#1 < 6); 731#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 730#L23-3 assume !(main_~c~0#1 < 6); 664#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 665#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 750#L23-3 assume !!(main_~c~0#1 < 6); 749#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 748#L23-3 assume !!(main_~c~0#1 < 6); 746#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 744#L23-3 assume !!(main_~c~0#1 < 6); 742#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 740#L23-3 assume !!(main_~c~0#1 < 6); 738#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 736#L23-3 assume !!(main_~c~0#1 < 6); 734#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 732#L23-3 assume !!(main_~c~0#1 < 6); 729#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 728#L23-3 assume !(main_~c~0#1 < 6); 727#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 726#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 725#L23-3 assume !!(main_~c~0#1 < 6); 724#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 723#L23-3 assume !!(main_~c~0#1 < 6); 722#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 721#L23-3 assume !!(main_~c~0#1 < 6); 720#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 719#L23-3 assume !!(main_~c~0#1 < 6); 718#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 717#L23-3 assume !!(main_~c~0#1 < 6); 716#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 715#L23-3 assume !!(main_~c~0#1 < 6); 714#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 713#L23-3 assume !(main_~c~0#1 < 6); 712#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 711#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 710#L23-3 assume !!(main_~c~0#1 < 6); 709#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 708#L23-3 assume !!(main_~c~0#1 < 6); 707#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 706#L23-3 assume !!(main_~c~0#1 < 6); 705#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 704#L23-3 assume !!(main_~c~0#1 < 6); 703#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 702#L23-3 assume !!(main_~c~0#1 < 6); 701#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 700#L23-3 assume !!(main_~c~0#1 < 6); 699#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 698#L23-3 assume !(main_~c~0#1 < 6); 697#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 696#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 695#L23-3 assume !!(main_~c~0#1 < 6); 694#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 693#L23-3 assume !!(main_~c~0#1 < 6); 692#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 691#L23-3 assume !!(main_~c~0#1 < 6); 690#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 689#L23-3 assume !!(main_~c~0#1 < 6); 688#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 687#L23-3 assume !!(main_~c~0#1 < 6); 686#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 685#L23-3 assume !!(main_~c~0#1 < 6); 684#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 683#L23-3 assume !(main_~c~0#1 < 6); 682#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 681#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 667#L23-3 assume !!(main_~c~0#1 < 6); 680#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 679#L23-3 assume !!(main_~c~0#1 < 6); 678#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 677#L23-3 assume !!(main_~c~0#1 < 6); 676#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 675#L23-3 assume !!(main_~c~0#1 < 6); 674#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 673#L23-3 assume !!(main_~c~0#1 < 6); 672#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 671#L23-3 assume !!(main_~c~0#1 < 6); 670#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 669#L23-3 assume !(main_~c~0#1 < 6); 668#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 666#L22-3 assume !(main_~b~0#1 < 6); 663#L21-2 main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1; 656#L21-3 [2024-11-23 02:38:45,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:45,376 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2024-11-23 02:38:45,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:45,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789092692] [2024-11-23 02:38:45,376 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-23 02:38:45,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:45,380 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-23 02:38:45,380 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:38:45,380 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:38:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:45,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:38:45,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:45,384 INFO L85 PathProgramCache]: Analyzing trace with hash -655757187, now seen corresponding path program 4 times [2024-11-23 02:38:45,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:45,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657522242] [2024-11-23 02:38:45,384 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:38:45,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:45,426 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:38:45,426 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:38:45,426 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:38:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:45,479 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:38:45,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:45,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1993610245, now seen corresponding path program 1 times [2024-11-23 02:38:45,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:45,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82160355] [2024-11-23 02:38:45,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:38:45,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:45,516 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:38:45,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:45,535 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:38:46,263 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:38:46,263 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:38:46,264 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:38:46,264 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:38:46,264 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-23 02:38:46,264 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:46,264 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:38:46,264 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:38:46,264 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration6_Loop [2024-11-23 02:38:46,264 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:38:46,264 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:38:46,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:46,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:46,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:46,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:46,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:46,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:46,321 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:38:46,322 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-23 02:38:46,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:46,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:46,325 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:46,329 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:38:46,329 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:38:46,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-23 02:38:46,344 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:38:46,345 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre5#1=0} Honda state: {ULTIMATE.start_main_#t~pre5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-23 02:38:46,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-23 02:38:46,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:46,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:46,353 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:46,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-23 02:38:46,356 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:38:46,356 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:38:46,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-11-23 02:38:46,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:46,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:46,377 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:46,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-23 02:38:46,386 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-23 02:38:46,386 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:38:46,409 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-23 02:38:46,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-11-23 02:38:46,415 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:38:46,415 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:38:46,415 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:38:46,415 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:38:46,415 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:38:46,416 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:46,416 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:38:46,416 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:38:46,416 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration6_Loop [2024-11-23 02:38:46,416 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:38:46,416 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:38:46,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:46,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:46,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:46,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:46,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:46,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:46,460 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:38:46,463 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:38:46,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:46,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:46,473 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:46,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-23 02:38:46,475 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:38:46,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:38:46,486 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:38:46,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:38:46,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:38:46,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:38:46,488 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:38:46,488 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:38:46,489 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:38:46,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-23 02:38:46,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:46,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:46,497 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:46,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-23 02:38:46,504 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:38:46,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:38:46,514 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:38:46,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:38:46,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:38:46,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:38:46,514 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:38:46,514 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:38:46,516 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:38:46,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-23 02:38:46,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:46,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:46,524 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:46,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-23 02:38:46,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:38:46,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:38:46,538 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:38:46,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:38:46,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:38:46,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:38:46,539 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:38:46,539 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:38:46,540 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:38:46,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-11-23 02:38:46,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:46,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:46,548 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:46,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-23 02:38:46,553 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:38:46,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:38:46,564 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:38:46,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:38:46,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:38:46,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:38:46,565 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:38:46,565 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:38:46,567 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:38:46,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-23 02:38:46,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:46,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:46,576 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:46,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-23 02:38:46,578 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:38:46,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:38:46,588 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:38:46,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:38:46,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:38:46,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:38:46,589 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:38:46,589 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:38:46,591 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:38:46,593 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-23 02:38:46,593 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-23 02:38:46,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:46,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:46,596 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:46,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-23 02:38:46,599 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:38:46,599 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-23 02:38:46,599 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:38:46,600 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~a~0#1) = -2*ULTIMATE.start_main_~a~0#1 + 11 Supporting invariants [] [2024-11-23 02:38:46,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-23 02:38:46,608 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-23 02:38:46,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:46,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:38:46,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:38:46,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:38:46,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:38:46,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:38:46,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:38:46,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-23 02:38:46,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1527 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1527 trivial. 0 not checked. [2024-11-23 02:38:46,960 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-23 02:38:46,961 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 95 states and 102 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:46,989 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 95 states and 102 transitions. cyclomatic complexity: 8. 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 188 states and 203 transitions. Complement of second has 4 states. [2024-11-23 02:38:46,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-23 02:38:46,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:46,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2024-11-23 02:38:46,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 2 letters. Loop has 93 letters. [2024-11-23 02:38:46,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:38:46,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 95 letters. Loop has 93 letters. [2024-11-23 02:38:46,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:38:46,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 2 letters. Loop has 186 letters. [2024-11-23 02:38:46,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:38:46,996 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 188 states and 203 transitions. [2024-11-23 02:38:47,000 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 25 [2024-11-23 02:38:47,002 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 188 states to 187 states and 202 transitions. [2024-11-23 02:38:47,002 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 [2024-11-23 02:38:47,002 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2024-11-23 02:38:47,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 187 states and 202 transitions. [2024-11-23 02:38:47,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:38:47,002 INFO L218 hiAutomatonCegarLoop]: Abstraction has 187 states and 202 transitions. [2024-11-23 02:38:47,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states and 202 transitions. [2024-11-23 02:38:47,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 111. [2024-11-23 02:38:47,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 111 states have (on average 1.09009009009009) internal successors, (121), 110 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:47,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2024-11-23 02:38:47,008 INFO L240 hiAutomatonCegarLoop]: Abstraction has 111 states and 121 transitions. [2024-11-23 02:38:47,008 INFO L425 stractBuchiCegarLoop]: Abstraction has 111 states and 121 transitions. [2024-11-23 02:38:47,008 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-23 02:38:47,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 121 transitions. [2024-11-23 02:38:47,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-11-23 02:38:47,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:38:47,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:38:47,010 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-23 02:38:47,010 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 1, 1, 1] [2024-11-23 02:38:47,010 INFO L745 eck$LassoCheckResult]: Stem: 1251#$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); 1252#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_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 1243#L21-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 1245#L22-3 [2024-11-23 02:38:47,010 INFO L747 eck$LassoCheckResult]: Loop: 1245#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 1253#L23-3 assume !!(main_~c~0#1 < 6); 1247#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 1248#L23-3 assume !!(main_~c~0#1 < 6); 1353#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 1352#L23-3 assume !!(main_~c~0#1 < 6); 1351#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 1350#L23-3 assume !!(main_~c~0#1 < 6); 1349#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 1348#L23-3 assume !!(main_~c~0#1 < 6); 1347#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 1346#L23-3 assume !!(main_~c~0#1 < 6); 1345#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 1344#L23-3 assume !(main_~c~0#1 < 6); 1257#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 1245#L22-3 [2024-11-23 02:38:47,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:47,010 INFO L85 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2024-11-23 02:38:47,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:47,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126977684] [2024-11-23 02:38:47,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:38:47,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:47,015 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:38:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:47,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:38:47,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:47,018 INFO L85 PathProgramCache]: Analyzing trace with hash -706979195, now seen corresponding path program 1 times [2024-11-23 02:38:47,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:47,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265918235] [2024-11-23 02:38:47,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:38:47,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:47,022 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:38:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:47,025 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:38:47,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:47,025 INFO L85 PathProgramCache]: Analyzing trace with hash 855328031, now seen corresponding path program 1 times [2024-11-23 02:38:47,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:47,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697805309] [2024-11-23 02:38:47,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:38:47,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:47,030 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:38:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:47,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:38:47,085 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:38:47,085 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:38:47,085 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:38:47,085 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:38:47,085 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-23 02:38:47,086 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:47,086 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:38:47,086 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:38:47,086 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration7_Loop [2024-11-23 02:38:47,086 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:38:47,086 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:38:47,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:47,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:47,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:47,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:47,117 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:38:47,117 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-23 02:38:47,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:47,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:47,119 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:47,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-23 02:38:47,124 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:38:47,124 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:38:47,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-23 02:38:47,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:47,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:47,155 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:47,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-23 02:38:47,159 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-23 02:38:47,160 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:38:47,181 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-23 02:38:47,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-23 02:38:47,188 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:38:47,188 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:38:47,188 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:38:47,188 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:38:47,188 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:38:47,188 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:47,188 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:38:47,188 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:38:47,188 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration7_Loop [2024-11-23 02:38:47,188 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:38:47,188 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:38:47,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:47,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:47,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:47,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:47,220 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:38:47,220 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:38:47,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:47,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:47,222 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:47,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-23 02:38:47,225 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:38:47,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:38:47,235 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:38:47,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:38:47,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:38:47,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:38:47,236 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:38:47,236 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:38:47,238 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:38:47,240 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-23 02:38:47,240 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-23 02:38:47,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:47,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:47,242 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:47,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-23 02:38:47,245 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:38:47,245 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-23 02:38:47,245 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:38:47,245 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~b~0#1) = -2*ULTIMATE.start_main_~b~0#1 + 11 Supporting invariants [] [2024-11-23 02:38:47,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-23 02:38:47,253 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-23 02:38:47,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:47,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:38:47,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:38:47,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:38:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:38:47,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:38:47,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:38:47,394 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-23 02:38:47,394 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-23 02:38:47,394 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 121 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:47,433 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 121 transitions. cyclomatic complexity: 12. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Result 320 states and 348 transitions. Complement of second has 7 states. [2024-11-23 02:38:47,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-23 02:38:47,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:47,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2024-11-23 02:38:47,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 3 letters. Loop has 15 letters. [2024-11-23 02:38:47,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:38:47,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 18 letters. Loop has 15 letters. [2024-11-23 02:38:47,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:38:47,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 3 letters. Loop has 30 letters. [2024-11-23 02:38:47,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:38:47,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 320 states and 348 transitions. [2024-11-23 02:38:47,450 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-11-23 02:38:47,452 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 320 states to 233 states and 254 transitions. [2024-11-23 02:38:47,452 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-11-23 02:38:47,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2024-11-23 02:38:47,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 233 states and 254 transitions. [2024-11-23 02:38:47,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:38:47,453 INFO L218 hiAutomatonCegarLoop]: Abstraction has 233 states and 254 transitions. [2024-11-23 02:38:47,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states and 254 transitions. [2024-11-23 02:38:47,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 129. [2024-11-23 02:38:47,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 129 states have (on average 1.1007751937984496) internal successors, (142), 128 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:47,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 142 transitions. [2024-11-23 02:38:47,472 INFO L240 hiAutomatonCegarLoop]: Abstraction has 129 states and 142 transitions. [2024-11-23 02:38:47,472 INFO L425 stractBuchiCegarLoop]: Abstraction has 129 states and 142 transitions. [2024-11-23 02:38:47,472 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-23 02:38:47,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states and 142 transitions. [2024-11-23 02:38:47,473 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-11-23 02:38:47,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:38:47,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:38:47,473 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-23 02:38:47,473 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-23 02:38:47,473 INFO L745 eck$LassoCheckResult]: Stem: 1760#$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); 1761#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_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 1751#L21-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 1753#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 1757#L23-3 [2024-11-23 02:38:47,474 INFO L747 eck$LassoCheckResult]: Loop: 1757#L23-3 assume !!(main_~c~0#1 < 6); 1756#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 1757#L23-3 [2024-11-23 02:38:47,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:47,474 INFO L85 PathProgramCache]: Analyzing trace with hash 925771, now seen corresponding path program 1 times [2024-11-23 02:38:47,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:47,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469300935] [2024-11-23 02:38:47,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:38:47,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:47,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:47,481 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:38:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:47,492 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:38:47,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:47,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1795, now seen corresponding path program 1 times [2024-11-23 02:38:47,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:47,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20448069] [2024-11-23 02:38:47,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:38:47,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:47,495 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:38:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:47,496 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:38:47,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:47,501 INFO L85 PathProgramCache]: Analyzing trace with hash 889666765, now seen corresponding path program 1 times [2024-11-23 02:38:47,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:47,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160691331] [2024-11-23 02:38:47,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:38:47,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:47,505 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:38:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:47,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:38:47,527 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:38:47,527 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:38:47,527 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:38:47,527 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:38:47,527 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-23 02:38:47,527 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:47,527 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:38:47,527 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:38:47,527 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration8_Loop [2024-11-23 02:38:47,527 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:38:47,527 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:38:47,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:47,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:47,552 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:38:47,552 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-23 02:38:47,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:47,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:47,555 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:47,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-23 02:38:47,566 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:38:47,567 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:38:47,581 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:38:47,581 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre4#1=0} Honda state: {ULTIMATE.start_main_#t~pre4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-23 02:38:47,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-11-23 02:38:47,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:47,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:47,595 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:47,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-23 02:38:47,599 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:38:47,599 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:38:47,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-23 02:38:47,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:47,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:47,626 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:47,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-23 02:38:47,629 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-23 02:38:47,629 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:38:47,657 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-23 02:38:47,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-11-23 02:38:47,663 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:38:47,663 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:38:47,663 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:38:47,663 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:38:47,663 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:38:47,663 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:47,663 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:38:47,664 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:38:47,664 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration8_Loop [2024-11-23 02:38:47,664 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:38:47,664 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:38:47,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:47,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:47,692 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:38:47,692 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:38:47,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:47,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:47,695 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:47,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-23 02:38:47,698 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:38:47,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:38:47,710 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:38:47,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:38:47,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:38:47,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:38:47,714 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:38:47,714 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:38:47,717 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:38:47,719 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-23 02:38:47,719 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-23 02:38:47,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:47,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:47,724 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:47,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-23 02:38:47,729 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:38:47,729 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-23 02:38:47,730 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:38:47,730 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0#1) = -2*ULTIMATE.start_main_~c~0#1 + 11 Supporting invariants [] [2024-11-23 02:38:47,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-23 02:38:47,739 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-23 02:38:47,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:47,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:38:47,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:38:47,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:38:47,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:38:47,786 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:38:47,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:38:47,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:38:47,802 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-23 02:38:47,802 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 129 states and 142 transitions. cyclomatic complexity: 17 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:47,819 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 129 states and 142 transitions. cyclomatic complexity: 17. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 180 states and 199 transitions. Complement of second has 7 states. [2024-11-23 02:38:47,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-23 02:38:47,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:47,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2024-11-23 02:38:47,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-23 02:38:47,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:38:47,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2024-11-23 02:38:47,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:38:47,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2024-11-23 02:38:47,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:38:47,822 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 180 states and 199 transitions. [2024-11-23 02:38:47,822 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-11-23 02:38:47,823 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 180 states to 160 states and 175 transitions. [2024-11-23 02:38:47,823 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-11-23 02:38:47,823 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-11-23 02:38:47,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 160 states and 175 transitions. [2024-11-23 02:38:47,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:38:47,826 INFO L218 hiAutomatonCegarLoop]: Abstraction has 160 states and 175 transitions. [2024-11-23 02:38:47,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states and 175 transitions. [2024-11-23 02:38:47,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 129. [2024-11-23 02:38:47,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 129 states have (on average 1.0930232558139534) internal successors, (141), 128 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:47,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 141 transitions. [2024-11-23 02:38:47,830 INFO L240 hiAutomatonCegarLoop]: Abstraction has 129 states and 141 transitions. [2024-11-23 02:38:47,830 INFO L425 stractBuchiCegarLoop]: Abstraction has 129 states and 141 transitions. [2024-11-23 02:38:47,830 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-23 02:38:47,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states and 141 transitions. [2024-11-23 02:38:47,831 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-11-23 02:38:47,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:38:47,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:38:47,831 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 2, 1, 1, 1, 1, 1] [2024-11-23 02:38:47,833 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-23 02:38:47,834 INFO L745 eck$LassoCheckResult]: Stem: 2110#$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); 2111#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_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 2101#L21-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 2103#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 2112#L23-3 assume !!(main_~c~0#1 < 6); 2108#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 2109#L23-3 assume !!(main_~c~0#1 < 6); 2228#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 2226#L23-3 assume !!(main_~c~0#1 < 6); 2224#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 2222#L23-3 assume !!(main_~c~0#1 < 6); 2220#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 2218#L23-3 assume !!(main_~c~0#1 < 6); 2216#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 2214#L23-3 assume !!(main_~c~0#1 < 6); 2211#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 2210#L23-3 assume !(main_~c~0#1 < 6); 2207#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 2147#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 2107#L23-3 [2024-11-23 02:38:47,834 INFO L747 eck$LassoCheckResult]: Loop: 2107#L23-3 assume !!(main_~c~0#1 < 6); 2106#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 2107#L23-3 [2024-11-23 02:38:47,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:47,834 INFO L85 PathProgramCache]: Analyzing trace with hash 745365203, now seen corresponding path program 2 times [2024-11-23 02:38:47,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:47,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439218366] [2024-11-23 02:38:47,834 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:38:47,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:47,839 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:38:47,839 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:38:47,839 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:38:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:47,847 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:38:47,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:47,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1795, now seen corresponding path program 2 times [2024-11-23 02:38:47,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:47,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558077649] [2024-11-23 02:38:47,851 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:38:47,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:47,852 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:38:47,852 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:38:47,852 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:38:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:47,853 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:38:47,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:47,853 INFO L85 PathProgramCache]: Analyzing trace with hash -963577515, now seen corresponding path program 3 times [2024-11-23 02:38:47,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:47,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954441153] [2024-11-23 02:38:47,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:38:47,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:47,863 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-11-23 02:38:47,864 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:38:47,864 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:38:47,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:47,872 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:38:47,881 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:38:47,881 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:38:47,881 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:38:47,881 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:38:47,882 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-23 02:38:47,882 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:47,882 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:38:47,882 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:38:47,882 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration9_Loop [2024-11-23 02:38:47,882 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:38:47,882 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:38:47,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:47,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:47,900 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:38:47,900 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-23 02:38:47,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:47,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:47,903 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:47,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-23 02:38:47,909 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:38:47,909 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:38:47,921 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:38:47,921 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre4#1=0} Honda state: {ULTIMATE.start_main_#t~pre4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-23 02:38:47,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-23 02:38:47,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:47,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:47,929 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:47,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-23 02:38:47,932 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:38:47,932 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:38:47,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-23 02:38:47,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:47,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:47,955 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:47,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-23 02:38:47,960 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-23 02:38:47,960 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:38:47,983 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-23 02:38:47,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-23 02:38:47,988 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:38:47,988 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:38:47,988 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:38:47,988 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:38:47,988 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:38:47,988 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:47,988 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:38:47,988 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:38:47,988 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration9_Loop [2024-11-23 02:38:47,988 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:38:47,988 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:38:47,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:47,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:48,014 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:38:48,014 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:38:48,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:48,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:48,015 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:48,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-23 02:38:48,022 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:38:48,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:38:48,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:38:48,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:38:48,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:38:48,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:38:48,033 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:38:48,033 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:38:48,035 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:38:48,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-11-23 02:38:48,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:48,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:48,046 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:48,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-23 02:38:48,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:38:48,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:38:48,062 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:38:48,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:38:48,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:38:48,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:38:48,065 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:38:48,065 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:38:48,068 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:38:48,071 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-23 02:38:48,071 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-23 02:38:48,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:48,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:48,074 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:48,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-23 02:38:48,076 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:38:48,076 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-23 02:38:48,076 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:38:48,076 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0#1) = -2*ULTIMATE.start_main_~c~0#1 + 11 Supporting invariants [] [2024-11-23 02:38:48,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-11-23 02:38:48,085 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-23 02:38:48,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:48,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:38:48,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:38:48,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:38:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:38:48,132 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:38:48,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:38:48,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:38:48,141 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-23 02:38:48,141 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 129 states and 141 transitions. cyclomatic complexity: 16 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:48,160 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 129 states and 141 transitions. cyclomatic complexity: 16. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 176 states and 193 transitions. Complement of second has 7 states. [2024-11-23 02:38:48,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-23 02:38:48,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:48,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2024-11-23 02:38:48,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 19 letters. Loop has 2 letters. [2024-11-23 02:38:48,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:38:48,161 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-23 02:38:48,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:38:48,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:38:48,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:38:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:38:48,204 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:38:48,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:38:48,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:38:48,215 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-23 02:38:48,216 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 129 states and 141 transitions. cyclomatic complexity: 16 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:48,236 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 129 states and 141 transitions. cyclomatic complexity: 16. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 176 states and 193 transitions. Complement of second has 7 states. [2024-11-23 02:38:48,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-23 02:38:48,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:48,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2024-11-23 02:38:48,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 19 letters. Loop has 2 letters. [2024-11-23 02:38:48,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:38:48,238 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-23 02:38:48,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:48,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:38:48,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:38:48,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:38:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:38:48,297 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:38:48,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:38:48,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:38:48,313 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-23 02:38:48,313 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 129 states and 141 transitions. cyclomatic complexity: 16 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:48,331 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 129 states and 141 transitions. cyclomatic complexity: 16. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 200 states and 221 transitions. Complement of second has 6 states. [2024-11-23 02:38:48,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-23 02:38:48,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:48,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2024-11-23 02:38:48,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 19 letters. Loop has 2 letters. [2024-11-23 02:38:48,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:38:48,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 21 letters. Loop has 2 letters. [2024-11-23 02:38:48,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:38:48,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 19 letters. Loop has 4 letters. [2024-11-23 02:38:48,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:38:48,333 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 200 states and 221 transitions. [2024-11-23 02:38:48,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-11-23 02:38:48,334 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 200 states to 112 states and 121 transitions. [2024-11-23 02:38:48,334 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-23 02:38:48,334 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-11-23 02:38:48,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 121 transitions. [2024-11-23 02:38:48,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:38:48,334 INFO L218 hiAutomatonCegarLoop]: Abstraction has 112 states and 121 transitions. [2024-11-23 02:38:48,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states and 121 transitions. [2024-11-23 02:38:48,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-11-23 02:38:48,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 111 states have (on average 1.0810810810810811) internal successors, (120), 110 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:48,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2024-11-23 02:38:48,336 INFO L240 hiAutomatonCegarLoop]: Abstraction has 111 states and 120 transitions. [2024-11-23 02:38:48,336 INFO L425 stractBuchiCegarLoop]: Abstraction has 111 states and 120 transitions. [2024-11-23 02:38:48,337 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-23 02:38:48,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 120 transitions. [2024-11-23 02:38:48,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-11-23 02:38:48,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:38:48,337 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:38:48,339 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [36, 36, 6, 6, 6, 2, 1, 1, 1, 1] [2024-11-23 02:38:48,339 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 1, 1, 1] [2024-11-23 02:38:48,339 INFO L745 eck$LassoCheckResult]: Stem: 3015#$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); 3016#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_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 3009#L21-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 3010#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 3119#L23-3 assume !!(main_~c~0#1 < 6); 3118#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3117#L23-3 assume !!(main_~c~0#1 < 6); 3115#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3113#L23-3 assume !!(main_~c~0#1 < 6); 3111#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3109#L23-3 assume !!(main_~c~0#1 < 6); 3107#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3105#L23-3 assume !!(main_~c~0#1 < 6); 3103#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3101#L23-3 assume !!(main_~c~0#1 < 6); 3098#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3097#L23-3 assume !(main_~c~0#1 < 6); 3023#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 3020#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 3019#L23-3 assume !!(main_~c~0#1 < 6); 3013#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3014#L23-3 assume !!(main_~c~0#1 < 6); 3116#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3114#L23-3 assume !!(main_~c~0#1 < 6); 3112#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3110#L23-3 assume !!(main_~c~0#1 < 6); 3108#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3106#L23-3 assume !!(main_~c~0#1 < 6); 3104#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3102#L23-3 assume !!(main_~c~0#1 < 6); 3100#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3099#L23-3 assume !(main_~c~0#1 < 6); 3096#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 3095#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 3094#L23-3 assume !!(main_~c~0#1 < 6); 3093#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3092#L23-3 assume !!(main_~c~0#1 < 6); 3091#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3090#L23-3 assume !!(main_~c~0#1 < 6); 3089#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3088#L23-3 assume !!(main_~c~0#1 < 6); 3087#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3086#L23-3 assume !!(main_~c~0#1 < 6); 3085#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3084#L23-3 assume !!(main_~c~0#1 < 6); 3083#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3082#L23-3 assume !(main_~c~0#1 < 6); 3081#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 3080#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 3079#L23-3 assume !!(main_~c~0#1 < 6); 3078#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3077#L23-3 assume !!(main_~c~0#1 < 6); 3076#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3075#L23-3 assume !!(main_~c~0#1 < 6); 3074#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3073#L23-3 assume !!(main_~c~0#1 < 6); 3072#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3071#L23-3 assume !!(main_~c~0#1 < 6); 3070#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3069#L23-3 assume !!(main_~c~0#1 < 6); 3068#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3067#L23-3 assume !(main_~c~0#1 < 6); 3066#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 3065#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 3064#L23-3 assume !!(main_~c~0#1 < 6); 3063#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3062#L23-3 assume !!(main_~c~0#1 < 6); 3061#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3060#L23-3 assume !!(main_~c~0#1 < 6); 3059#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3058#L23-3 assume !!(main_~c~0#1 < 6); 3057#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3056#L23-3 assume !!(main_~c~0#1 < 6); 3055#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3054#L23-3 assume !!(main_~c~0#1 < 6); 3053#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3052#L23-3 assume !(main_~c~0#1 < 6); 3051#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 3050#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 3027#L23-3 assume !!(main_~c~0#1 < 6); 3049#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3048#L23-3 assume !!(main_~c~0#1 < 6); 3047#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3046#L23-3 assume !!(main_~c~0#1 < 6); 3044#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3042#L23-3 assume !!(main_~c~0#1 < 6); 3040#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3038#L23-3 assume !!(main_~c~0#1 < 6); 3036#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3034#L23-3 assume !!(main_~c~0#1 < 6); 3031#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3030#L23-3 assume !(main_~c~0#1 < 6); 3028#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 3026#L22-3 assume !(main_~b~0#1 < 6); 3021#L21-2 main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1; 3011#L21-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 3012#L22-3 [2024-11-23 02:38:48,341 INFO L747 eck$LassoCheckResult]: Loop: 3012#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 3017#L23-3 assume !!(main_~c~0#1 < 6); 3018#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3045#L23-3 assume !!(main_~c~0#1 < 6); 3043#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3041#L23-3 assume !!(main_~c~0#1 < 6); 3039#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3037#L23-3 assume !!(main_~c~0#1 < 6); 3035#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3033#L23-3 assume !!(main_~c~0#1 < 6); 3032#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3029#L23-3 assume !!(main_~c~0#1 < 6); 3025#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3024#L23-3 assume !(main_~c~0#1 < 6); 3022#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 3012#L22-3 [2024-11-23 02:38:48,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:48,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1672375441, now seen corresponding path program 2 times [2024-11-23 02:38:48,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:48,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319435217] [2024-11-23 02:38:48,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:38:48,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:48,352 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:38:48,352 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:38:48,352 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:38:48,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:48,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:38:48,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-11-23 02:38:48,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:48,407 INFO L85 PathProgramCache]: Analyzing trace with hash -706979195, now seen corresponding path program 2 times [2024-11-23 02:38:48,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:48,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668661842] [2024-11-23 02:38:48,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:38:48,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:48,410 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:38:48,410 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:38:48,410 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:38:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:48,412 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:38:48,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:48,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1669350057, now seen corresponding path program 3 times [2024-11-23 02:38:48,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:38:48,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43722436] [2024-11-23 02:38:48,412 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:38:48,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:38:48,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-23 02:38:48,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-23 02:38:48,447 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2024-11-23 02:38:48,451 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:38:48,451 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:38:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:38:48,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:38:48,680 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:38:48,681 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:38:48,681 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:38:48,681 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:38:48,681 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-23 02:38:48,681 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:48,681 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:38:48,681 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:38:48,681 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration10_Loop [2024-11-23 02:38:48,681 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:38:48,681 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:38:48,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:48,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:48,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:48,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:48,817 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:38:48,817 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-23 02:38:48,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:48,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:48,820 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:48,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-23 02:38:48,821 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:38:48,821 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:38:48,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-11-23 02:38:48,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:48,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:48,841 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:48,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-23 02:38:48,844 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-23 02:38:48,844 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:38:48,865 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-23 02:38:48,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-11-23 02:38:48,870 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:38:48,870 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:38:48,870 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:38:48,870 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:38:48,870 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:38:48,870 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:48,870 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:38:48,870 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:38:48,870 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration10_Loop [2024-11-23 02:38:48,870 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:38:48,870 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:38:48,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:48,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:48,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:48,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:38:48,902 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:38:48,902 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:38:48,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:48,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:48,905 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:48,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-23 02:38:48,906 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:38:48,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:38:48,916 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:38:48,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:38:48,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:38:48,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:38:48,916 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:38:48,916 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:38:48,918 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:38:48,920 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-23 02:38:48,920 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-23 02:38:48,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:38:48,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:38:48,922 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:38:48,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-23 02:38:48,924 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:38:48,924 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-23 02:38:48,924 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:38:48,924 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~b~0#1) = -2*ULTIMATE.start_main_~b~0#1 + 11 Supporting invariants [] [2024-11-23 02:38:48,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-11-23 02:38:48,931 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-23 02:38:48,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:38:48,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:38:48,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:38:49,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:38:49,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:38:49,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:38:49,144 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-23 02:38:49,144 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-23 02:38:49,145 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 120 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:49,159 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 120 transitions. cyclomatic complexity: 11. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Result 290 states and 314 transitions. Complement of second has 7 states. [2024-11-23 02:38:49,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-23 02:38:49,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:49,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2024-11-23 02:38:49,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 96 letters. Loop has 15 letters. [2024-11-23 02:38:49,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:38:49,160 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-23 02:38:49,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:38:49,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:38:49,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:38:49,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:38:49,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:38:49,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:38:49,351 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-23 02:38:49,351 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-23 02:38:49,351 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 120 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:49,365 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 120 transitions. cyclomatic complexity: 11. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Result 290 states and 314 transitions. Complement of second has 7 states. [2024-11-23 02:38:49,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-23 02:38:49,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:49,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2024-11-23 02:38:49,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 96 letters. Loop has 15 letters. [2024-11-23 02:38:49,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:38:49,367 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-23 02:38:49,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:38:49,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:38:49,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:38:49,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:38:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:38:49,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:38:49,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:38:49,558 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-23 02:38:49,558 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-23 02:38:49,558 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 120 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:49,573 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 120 transitions. cyclomatic complexity: 11. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Result 212 states and 230 transitions. Complement of second has 6 states. [2024-11-23 02:38:49,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-23 02:38:49,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:38:49,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2024-11-23 02:38:49,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 96 letters. Loop has 15 letters. [2024-11-23 02:38:49,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:38:49,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 111 letters. Loop has 15 letters. [2024-11-23 02:38:49,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:38:49,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 96 letters. Loop has 30 letters. [2024-11-23 02:38:49,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:38:49,575 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 212 states and 230 transitions. [2024-11-23 02:38:49,576 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-23 02:38:49,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 212 states to 0 states and 0 transitions. [2024-11-23 02:38:49,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-23 02:38:49,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-23 02:38:49,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-23 02:38:49,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:38:49,576 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-23 02:38:49,576 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-23 02:38:49,576 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-23 02:38:49,576 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-23 02:38:49,576 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-23 02:38:49,576 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-23 02:38:49,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-23 02:38:49,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 02:38:49 BoogieIcfgContainer [2024-11-23 02:38:49,582 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-23 02:38:49,582 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-23 02:38:49,582 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-23 02:38:49,583 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-23 02:38:49,583 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:38:43" (3/4) ... [2024-11-23 02:38:49,584 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-23 02:38:49,585 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-23 02:38:49,586 INFO L158 Benchmark]: Toolchain (without parser) took 6390.50ms. Allocated memory was 184.5MB in the beginning and 245.4MB in the end (delta: 60.8MB). Free memory was 118.2MB in the beginning and 103.0MB in the end (delta: 15.2MB). Peak memory consumption was 77.9MB. Max. memory is 16.1GB. [2024-11-23 02:38:49,586 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 104.9MB. Free memory is still 66.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 02:38:49,586 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.45ms. Allocated memory is still 184.5MB. Free memory was 118.1MB in the beginning and 106.2MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-23 02:38:49,586 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.49ms. Allocated memory is still 184.5MB. Free memory was 106.0MB in the beginning and 157.4MB in the end (delta: -51.4MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2024-11-23 02:38:49,586 INFO L158 Benchmark]: Boogie Preprocessor took 81.93ms. Allocated memory is still 184.5MB. Free memory was 157.4MB in the beginning and 155.9MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-23 02:38:49,586 INFO L158 Benchmark]: RCFGBuilder took 287.64ms. Allocated memory is still 184.5MB. Free memory was 155.3MB in the beginning and 145.4MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-23 02:38:49,586 INFO L158 Benchmark]: BuchiAutomizer took 5723.85ms. Allocated memory was 184.5MB in the beginning and 245.4MB in the end (delta: 60.8MB). Free memory was 145.4MB in the beginning and 104.1MB in the end (delta: 41.4MB). Peak memory consumption was 106.8MB. Max. memory is 16.1GB. [2024-11-23 02:38:49,587 INFO L158 Benchmark]: Witness Printer took 2.84ms. Allocated memory is still 245.4MB. Free memory was 104.1MB in the beginning and 103.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 02:38:49,587 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 104.9MB. Free memory is still 66.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.45ms. Allocated memory is still 184.5MB. Free memory was 118.1MB in the beginning and 106.2MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.49ms. Allocated memory is still 184.5MB. Free memory was 106.0MB in the beginning and 157.4MB in the end (delta: -51.4MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.93ms. Allocated memory is still 184.5MB. Free memory was 157.4MB in the beginning and 155.9MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 287.64ms. Allocated memory is still 184.5MB. Free memory was 155.3MB in the beginning and 145.4MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 5723.85ms. Allocated memory was 184.5MB in the beginning and 245.4MB in the end (delta: 60.8MB). Free memory was 145.4MB in the beginning and 104.1MB in the end (delta: 41.4MB). Peak memory consumption was 106.8MB. Max. memory is 16.1GB. * Witness Printer took 2.84ms. Allocated memory is still 245.4MB. Free memory was 104.1MB in the beginning and 103.0MB in the end (delta: 1.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 10 terminating modules (5 trivial, 3 deterministic, 2 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 deterministic module has affine ranking function (((long long) -2 * c) + 11) and consists of 4 locations. One nondeterministic module has affine ranking function (((long long) -2 * c) + 11) and consists of 4 locations. One nondeterministic module has affine ranking function (((long long) -2 * b) + 11) and consists of 4 locations. 5 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.6s and 11 iterations. TraceHistogramMax:36. Analysis of lassos took 3.5s. Construction of modules took 0.1s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 230 StatesRemovedByMinimization, 7 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 [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1599/1599 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 165 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 156 mSDsluCounter, 224 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 101 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 154 IncrementalHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 123 mSDtfsCounter, 154 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI5 SFLT5 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp83 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-23 02:38:49,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-11-23 02:38:49,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-23 02:38:50,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-23 02:38:50,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-23 02:38:50,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE