./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 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loop-simple/nested_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-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 21:27:39,923 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 21:27:40,012 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-12 21:27:40,018 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 21:27:40,019 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 21:27:40,034 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 21:27:40,034 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 21:27:40,034 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 21:27:40,035 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 21:27:40,035 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 21:27:40,036 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 21:27:40,036 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 21:27:40,036 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 21:27:40,036 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-12 21:27:40,037 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-12 21:27:40,037 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-12 21:27:40,037 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-12 21:27:40,037 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-12 21:27:40,038 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-12 21:27:40,038 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 21:27:40,038 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-12 21:27:40,041 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 21:27:40,042 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 21:27:40,042 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 21:27:40,042 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 21:27:40,042 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-12 21:27:40,042 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-12 21:27:40,042 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-12 21:27:40,043 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 21:27:40,043 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 21:27:40,043 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 21:27:40,043 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 21:27:40,043 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-12 21:27:40,044 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 21:27:40,044 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 21:27:40,044 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 21:27:40,044 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 21:27:40,044 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 21:27:40,045 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-12 21:27:40,045 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-12 21:27:40,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 21:27:40,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 21:27:40,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 21:27:40,252 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 21:27:40,253 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 21:27:40,253 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-12 21:27:41,468 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 21:27:41,620 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 21:27:41,620 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_3.c [2024-11-12 21:27:41,626 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/989d32eaa/4d91f368dbbc4e4f91df9b5fb72de02d/FLAG8bad3c794 [2024-11-12 21:27:42,039 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/989d32eaa/4d91f368dbbc4e4f91df9b5fb72de02d [2024-11-12 21:27:42,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 21:27:42,042 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 21:27:42,043 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 21:27:42,044 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 21:27:42,048 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 21:27:42,048 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 09:27:42" (1/1) ... [2024-11-12 21:27:42,049 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bd32e97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:42, skipping insertion in model container [2024-11-12 21:27:42,049 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 09:27:42" (1/1) ... [2024-11-12 21:27:42,064 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 21:27:42,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 21:27:42,204 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 21:27:42,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 21:27:42,236 INFO L204 MainTranslator]: Completed translation [2024-11-12 21:27:42,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:42 WrapperNode [2024-11-12 21:27:42,248 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 21:27:42,250 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 21:27:42,250 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 21:27:42,250 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 21:27:42,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:42" (1/1) ... [2024-11-12 21:27:42,264 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:42" (1/1) ... [2024-11-12 21:27:42,279 INFO L138 Inliner]: procedures = 10, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 41 [2024-11-12 21:27:42,279 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 21:27:42,280 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 21:27:42,280 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 21:27:42,280 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 21:27:42,289 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:42" (1/1) ... [2024-11-12 21:27:42,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:42" (1/1) ... [2024-11-12 21:27:42,291 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:42" (1/1) ... [2024-11-12 21:27:42,298 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-12 21:27:42,298 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:42" (1/1) ... [2024-11-12 21:27:42,298 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:42" (1/1) ... [2024-11-12 21:27:42,300 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:42" (1/1) ... [2024-11-12 21:27:42,304 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:42" (1/1) ... [2024-11-12 21:27:42,304 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:42" (1/1) ... [2024-11-12 21:27:42,305 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:42" (1/1) ... [2024-11-12 21:27:42,305 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 21:27:42,306 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 21:27:42,306 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 21:27:42,306 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 21:27:42,307 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:42" (1/1) ... [2024-11-12 21:27:42,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:42,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:42,335 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-12 21:27:42,346 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-12 21:27:42,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 21:27:42,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 21:27:42,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 21:27:42,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 21:27:42,433 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 21:27:42,435 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 21:27:42,539 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-12 21:27:42,540 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 21:27:42,552 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 21:27:42,553 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-12 21:27:42,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 09:27:42 BoogieIcfgContainer [2024-11-12 21:27:42,554 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 21:27:42,555 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-12 21:27:42,555 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-12 21:27:42,558 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-12 21:27:42,559 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 21:27:42,560 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.11 09:27:42" (1/3) ... [2024-11-12 21:27:42,561 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f57c432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 09:27:42, skipping insertion in model container [2024-11-12 21:27:42,561 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 21:27:42,562 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:27:42" (2/3) ... [2024-11-12 21:27:42,562 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f57c432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 09:27:42, skipping insertion in model container [2024-11-12 21:27:42,562 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 21:27:42,563 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 09:27:42" (3/3) ... [2024-11-12 21:27:42,564 INFO L332 chiAutomizerObserver]: Analyzing ICFG nested_3.c [2024-11-12 21:27:42,612 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2024-11-12 21:27:42,613 INFO L302 stractBuchiCegarLoop]: Hoare is None [2024-11-12 21:27:42,613 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-12 21:27:42,613 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-12 21:27:42,613 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-12 21:27:42,613 INFO L306 stractBuchiCegarLoop]: Difference is false [2024-11-12 21:27:42,614 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-12 21:27:42,614 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-12 21:27:42,618 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-12 21:27:42,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-12 21:27:42,633 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:27:42,633 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:27:42,637 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 21:27:42,637 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-12 21:27:42,637 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-12 21:27:42,638 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-12 21:27:42,639 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-12 21:27:42,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:27:42,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:27:42,640 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 21:27:42,640 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-12 21:27:42,646 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "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;" [2024-11-12 21:27:42,646 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0;" "assume !(main_~b~0#1 < 6);" "main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1;" [2024-11-12 21:27:42,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:42,654 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-12 21:27:42,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:42,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913095271] [2024-11-12 21:27:42,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:42,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:42,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:42,738 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:27:42,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:42,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:27:42,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:42,768 INFO L85 PathProgramCache]: Analyzing trace with hash 39933, now seen corresponding path program 1 times [2024-11-12 21:27:42,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:42,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844841621] [2024-11-12 21:27:42,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:42,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:42,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:27:42,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844841621] [2024-11-12 21:27:42,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844841621] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:27:42,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771847322] [2024-11-12 21:27:42,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:42,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:27:42,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:42,832 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-12 21:27:42,833 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-12 21:27:42,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:42,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 21:27:42,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:27:42,878 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:27:42,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771847322] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:27:42,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:27:42,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 3 [2024-11-12 21:27:42,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13819717] [2024-11-12 21:27:42,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:27:42,892 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 21:27:42,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:27:42,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 21:27:42,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 21:27:42,924 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 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:27:42,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:27:42,958 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2024-11-12 21:27:42,959 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2024-11-12 21:27:42,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2024-11-12 21:27:42,963 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 16 transitions. [2024-11-12 21:27:42,964 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-12 21:27:42,964 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-12 21:27:42,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2024-11-12 21:27:42,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:27:42,966 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-11-12 21:27:42,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2024-11-12 21:27:42,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-12 21:27:42,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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-12 21:27:42,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2024-11-12 21:27:42,986 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-11-12 21:27:42,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 21:27:42,990 INFO L426 stractBuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-11-12 21:27:42,992 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-12 21:27:42,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2024-11-12 21:27:42,994 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2024-11-12 21:27:42,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:27:42,995 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:27:42,995 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 21:27:42,995 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1] [2024-11-12 21:27:42,996 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "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;" [2024-11-12 21:27:42,996 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0;" "assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0;" "assume !(main_~c~0#1 < 6);" "main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0;" "assume !(main_~c~0#1 < 6);" "main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume !(main_~b~0#1 < 6);" "main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1;" [2024-11-12 21:27:42,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:42,999 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-12 21:27:43,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:43,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973656821] [2024-11-12 21:27:43,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:43,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:43,008 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:27:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:43,018 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:27:43,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:43,020 INFO L85 PathProgramCache]: Analyzing trace with hash 973380349, now seen corresponding path program 1 times [2024-11-12 21:27:43,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:43,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041394018] [2024-11-12 21:27:43,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:43,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:43,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:27:43,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041394018] [2024-11-12 21:27:43,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041394018] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:27:43,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781039022] [2024-11-12 21:27:43,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:43,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:27:43,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:43,078 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-12 21:27:43,079 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-12 21:27:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:43,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 21:27:43,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:27:43,117 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:27:43,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781039022] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:27:43,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:27:43,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2024-11-12 21:27:43,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345134134] [2024-11-12 21:27:43,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:27:43,140 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 21:27:43,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:27:43,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 21:27:43,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 21:27:43,142 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. cyclomatic complexity: 4 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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-12 21:27:43,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:27:43,163 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2024-11-12 21:27:43,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 22 transitions. [2024-11-12 21:27:43,165 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2024-11-12 21:27:43,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 22 transitions. [2024-11-12 21:27:43,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-12 21:27:43,167 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-12 21:27:43,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2024-11-12 21:27:43,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:27:43,168 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-12 21:27:43,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2024-11-12 21:27:43,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-12 21:27:43,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:27:43,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-11-12 21:27:43,170 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-12 21:27:43,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 21:27:43,171 INFO L426 stractBuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-12 21:27:43,171 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-12 21:27:43,171 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2024-11-12 21:27:43,172 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2024-11-12 21:27:43,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:27:43,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:27:43,172 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 21:27:43,172 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 2, 1, 1, 1] [2024-11-12 21:27:43,172 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "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;" [2024-11-12 21:27:43,173 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0;" "assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);" "main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);" "main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume !(main_~b~0#1 < 6);" "main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1;" [2024-11-12 21:27:43,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:43,175 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-11-12 21:27:43,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:43,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928911614] [2024-11-12 21:27:43,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:43,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:43,181 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:27:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:43,187 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:27:43,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:43,187 INFO L85 PathProgramCache]: Analyzing trace with hash 472740477, now seen corresponding path program 1 times [2024-11-12 21:27:43,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:43,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044638667] [2024-11-12 21:27:43,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:43,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:43,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:43,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:27:43,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044638667] [2024-11-12 21:27:43,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044638667] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:27:43,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007764892] [2024-11-12 21:27:43,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:43,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:27:43,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:43,278 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-12 21:27:43,280 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-12 21:27:43,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:43,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 21:27:43,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:27:43,346 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:27:43,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007764892] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:27:43,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:27:43,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-12 21:27:43,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081253888] [2024-11-12 21:27:43,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:27:43,390 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 21:27:43,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:27:43,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 21:27:43,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-12 21:27:43,391 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. cyclomatic complexity: 4 Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 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-12 21:27:43,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:27:43,417 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2024-11-12 21:27:43,417 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 38 transitions. [2024-11-12 21:27:43,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2024-11-12 21:27:43,418 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 38 transitions. [2024-11-12 21:27:43,418 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2024-11-12 21:27:43,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2024-11-12 21:27:43,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 38 transitions. [2024-11-12 21:27:43,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:27:43,419 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-12 21:27:43,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 38 transitions. [2024-11-12 21:27:43,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-12 21:27:43,420 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-12 21:27:43,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-11-12 21:27:43,421 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-12 21:27:43,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 21:27:43,422 INFO L426 stractBuchiCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-12 21:27:43,422 INFO L333 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-12 21:27:43,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 38 transitions. [2024-11-12 21:27:43,423 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2024-11-12 21:27:43,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:27:43,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:27:43,423 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 21:27:43,423 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 2, 2, 2, 1, 1, 1] [2024-11-12 21:27:43,423 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "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;" [2024-11-12 21:27:43,423 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0;" "assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);" "main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);" "main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume !(main_~b~0#1 < 6);" "main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1;" [2024-11-12 21:27:43,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:43,424 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-11-12 21:27:43,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:43,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136016504] [2024-11-12 21:27:43,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:43,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:43,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:43,429 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:27:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:43,434 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:27:43,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:43,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1010871677, now seen corresponding path program 2 times [2024-11-12 21:27:43,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:43,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192735163] [2024-11-12 21:27:43,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:43,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:43,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:43,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:27:43,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192735163] [2024-11-12 21:27:43,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192735163] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:27:43,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85644764] [2024-11-12 21:27:43,546 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 21:27:43,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:27:43,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:43,548 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:27:43,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 21:27:43,584 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 21:27:43,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 21:27:43,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2024-11-12 21:27:43,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310118328] [2024-11-12 21:27:43,585 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 21:27:43,585 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 21:27:43,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:27:43,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 21:27:43,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-12 21:27:43,586 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. cyclomatic complexity: 4 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-12 21:27:43,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:27:43,606 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2024-11-12 21:27:43,606 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 69 transitions. [2024-11-12 21:27:43,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2024-11-12 21:27:43,611 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 64 states and 69 transitions. [2024-11-12 21:27:43,611 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2024-11-12 21:27:43,611 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2024-11-12 21:27:43,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 69 transitions. [2024-11-12 21:27:43,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:27:43,611 INFO L218 hiAutomatonCegarLoop]: Abstraction has 64 states and 69 transitions. [2024-11-12 21:27:43,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 69 transitions. [2024-11-12 21:27:43,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 50. [2024-11-12 21:27:43,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.08) internal successors, (54), 49 states have internal predecessors, (54), 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-12 21:27:43,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2024-11-12 21:27:43,616 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 54 transitions. [2024-11-12 21:27:43,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 21:27:43,619 INFO L426 stractBuchiCegarLoop]: Abstraction has 50 states and 54 transitions. [2024-11-12 21:27:43,619 INFO L333 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-12 21:27:43,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 54 transitions. [2024-11-12 21:27:43,619 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2024-11-12 21:27:43,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:27:43,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:27:43,620 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 21:27:43,620 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [18, 18, 3, 3, 3, 1, 1, 1] [2024-11-12 21:27:43,620 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "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;" [2024-11-12 21:27:43,620 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0;" "assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);" "main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);" "main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);" "main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume !(main_~b~0#1 < 6);" "main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1;" [2024-11-12 21:27:43,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:43,621 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-11-12 21:27:43,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:43,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74885786] [2024-11-12 21:27:43,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:43,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:43,629 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:27:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:43,636 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:27:43,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:43,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1150950735, now seen corresponding path program 3 times [2024-11-12 21:27:43,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:43,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161111922] [2024-11-12 21:27:43,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:43,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:43,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:43,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:27:43,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161111922] [2024-11-12 21:27:43,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161111922] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:27:43,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350201154] [2024-11-12 21:27:43,795 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 21:27:43,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:27:43,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:43,797 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:27:43,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-12 21:27:43,822 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 21:27:43,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 21:27:43,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2024-11-12 21:27:43,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540760962] [2024-11-12 21:27:43,823 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 21:27:43,823 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 21:27:43,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:27:43,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 21:27:43,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 21:27:43,824 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. cyclomatic complexity: 5 Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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-12 21:27:43,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:27:43,848 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2024-11-12 21:27:43,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 85 transitions. [2024-11-12 21:27:43,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2024-11-12 21:27:43,850 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 79 states and 85 transitions. [2024-11-12 21:27:43,850 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2024-11-12 21:27:43,850 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2024-11-12 21:27:43,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 85 transitions. [2024-11-12 21:27:43,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:27:43,850 INFO L218 hiAutomatonCegarLoop]: Abstraction has 79 states and 85 transitions. [2024-11-12 21:27:43,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 85 transitions. [2024-11-12 21:27:43,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 65. [2024-11-12 21:27:43,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 64 states have internal predecessors, (70), 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-12 21:27:43,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2024-11-12 21:27:43,857 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 70 transitions. [2024-11-12 21:27:43,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 21:27:43,858 INFO L426 stractBuchiCegarLoop]: Abstraction has 65 states and 70 transitions. [2024-11-12 21:27:43,859 INFO L333 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-12 21:27:43,859 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 70 transitions. [2024-11-12 21:27:43,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2024-11-12 21:27:43,862 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:27:43,862 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:27:43,862 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 21:27:43,862 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [24, 24, 4, 4, 4, 1, 1, 1] [2024-11-12 21:27:43,863 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "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;" [2024-11-12 21:27:43,863 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0;" "assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);" "main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);" "main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);" "main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);" "main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume !(main_~b~0#1 < 6);" "main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1;" [2024-11-12 21:27:43,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:43,863 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2024-11-12 21:27:43,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:43,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119994665] [2024-11-12 21:27:43,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:43,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:43,867 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:27:43,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:43,869 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:27:43,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:43,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1915821821, now seen corresponding path program 4 times [2024-11-12 21:27:43,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:43,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549118213] [2024-11-12 21:27:43,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:43,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:43,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:27:43,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549118213] [2024-11-12 21:27:43,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549118213] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:27:43,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386927620] [2024-11-12 21:27:43,975 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-12 21:27:43,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:27:43,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:43,977 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:27:43,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-12 21:27:44,003 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 21:27:44,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 21:27:44,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2024-11-12 21:27:44,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078968213] [2024-11-12 21:27:44,004 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 21:27:44,004 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 21:27:44,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:27:44,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 21:27:44,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-12 21:27:44,005 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. cyclomatic complexity: 6 Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:27:44,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:27:44,022 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2024-11-12 21:27:44,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 101 transitions. [2024-11-12 21:27:44,024 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2024-11-12 21:27:44,025 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 94 states and 101 transitions. [2024-11-12 21:27:44,025 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2024-11-12 21:27:44,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2024-11-12 21:27:44,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 101 transitions. [2024-11-12 21:27:44,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:27:44,025 INFO L218 hiAutomatonCegarLoop]: Abstraction has 94 states and 101 transitions. [2024-11-12 21:27:44,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 101 transitions. [2024-11-12 21:27:44,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2024-11-12 21:27:44,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 80 states have (on average 1.075) internal successors, (86), 79 states have internal predecessors, (86), 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-12 21:27:44,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2024-11-12 21:27:44,028 INFO L240 hiAutomatonCegarLoop]: Abstraction has 80 states and 86 transitions. [2024-11-12 21:27:44,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 21:27:44,032 INFO L426 stractBuchiCegarLoop]: Abstraction has 80 states and 86 transitions. [2024-11-12 21:27:44,032 INFO L333 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-12 21:27:44,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 86 transitions. [2024-11-12 21:27:44,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2024-11-12 21:27:44,032 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:27:44,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:27:44,033 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 21:27:44,033 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [30, 30, 5, 5, 5, 1, 1, 1] [2024-11-12 21:27:44,033 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "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;" [2024-11-12 21:27:44,033 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0;" "assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);" "main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);" "main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);" "main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);" "main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);" "main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume !(main_~b~0#1 < 6);" "main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1;" [2024-11-12 21:27:44,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:44,034 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2024-11-12 21:27:44,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:44,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117046298] [2024-11-12 21:27:44,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:44,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:44,038 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:27:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:44,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:27:44,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:44,043 INFO L85 PathProgramCache]: Analyzing trace with hash 324288817, now seen corresponding path program 5 times [2024-11-12 21:27:44,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:44,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219240980] [2024-11-12 21:27:44,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:44,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:44,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:44,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:27:44,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219240980] [2024-11-12 21:27:44,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219240980] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:27:44,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6568780] [2024-11-12 21:27:44,163 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-12 21:27:44,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:27:44,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:44,166 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:27:44,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-12 21:27:44,195 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 21:27:44,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 21:27:44,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-11-12 21:27:44,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387524382] [2024-11-12 21:27:44,196 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 21:27:44,196 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 21:27:44,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:27:44,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 21:27:44,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-12 21:27:44,197 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. cyclomatic complexity: 7 Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 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-12 21:27:44,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:27:44,217 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2024-11-12 21:27:44,217 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 102 transitions. [2024-11-12 21:27:44,218 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2024-11-12 21:27:44,218 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 95 states and 102 transitions. [2024-11-12 21:27:44,218 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2024-11-12 21:27:44,218 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2024-11-12 21:27:44,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 102 transitions. [2024-11-12 21:27:44,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:27:44,219 INFO L218 hiAutomatonCegarLoop]: Abstraction has 95 states and 102 transitions. [2024-11-12 21:27:44,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 102 transitions. [2024-11-12 21:27:44,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-12 21:27:44,222 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-12 21:27:44,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2024-11-12 21:27:44,222 INFO L240 hiAutomatonCegarLoop]: Abstraction has 95 states and 102 transitions. [2024-11-12 21:27:44,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 21:27:44,223 INFO L426 stractBuchiCegarLoop]: Abstraction has 95 states and 102 transitions. [2024-11-12 21:27:44,223 INFO L333 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-12 21:27:44,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 102 transitions. [2024-11-12 21:27:44,224 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2024-11-12 21:27:44,224 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:27:44,224 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:27:44,224 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 21:27:44,224 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [36, 36, 6, 6, 6, 1, 1, 1] [2024-11-12 21:27:44,225 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "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;" [2024-11-12 21:27:44,225 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0;" "assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);" "main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);" "main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);" "main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);" "main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);" "main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);" "main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume !(main_~b~0#1 < 6);" "main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1;" [2024-11-12 21:27:44,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:44,225 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2024-11-12 21:27:44,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:44,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386353012] [2024-11-12 21:27:44,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:44,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:44,228 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:27:44,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:44,230 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:27:44,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:44,230 INFO L85 PathProgramCache]: Analyzing trace with hash -655757187, now seen corresponding path program 6 times [2024-11-12 21:27:44,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:44,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778312251] [2024-11-12 21:27:44,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:44,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:44,246 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:27:44,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:44,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:27:44,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:44,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1993610245, now seen corresponding path program 1 times [2024-11-12 21:27:44,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:44,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395853191] [2024-11-12 21:27:44,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:44,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:44,285 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:27:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:44,299 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:27:44,968 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 21:27:44,969 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 21:27:44,969 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 21:27:44,969 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 21:27:44,969 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-12 21:27:44,969 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:44,970 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 21:27:44,970 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 21:27:44,970 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration8_Loop [2024-11-12 21:27:44,970 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 21:27:44,970 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 21:27:44,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:44,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:44,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:44,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:44,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:44,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:45,049 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 21:27:45,050 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-12 21:27:45,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:45,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:45,053 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-12 21:27:45,054 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-12 21:27:45,058 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:27:45,058 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:27:45,078 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-12 21:27:45,078 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0#1=6} Honda state: {ULTIMATE.start_main_~c~0#1=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-12 21:27:45,095 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-12 21:27:45,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:45,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:45,097 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-12 21:27:45,098 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-12 21:27:45,100 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:27:45,100 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:27:45,114 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-12 21:27:45,114 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-12 21:27:45,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-12 21:27:45,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:45,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:45,127 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-12 21:27:45,128 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-12 21:27:45,130 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:27:45,130 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:27:45,153 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-12 21:27:45,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:45,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:45,154 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-12 21:27:45,155 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-12 21:27:45,157 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-12 21:27:45,157 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:27:45,184 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-12 21:27:45,189 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-12 21:27:45,189 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 21:27:45,190 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 21:27:45,190 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 21:27:45,190 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 21:27:45,190 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-12 21:27:45,190 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:45,190 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 21:27:45,190 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 21:27:45,190 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration8_Loop [2024-11-12 21:27:45,190 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 21:27:45,190 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 21:27:45,191 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:45,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:45,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:45,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:45,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:45,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:45,243 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 21:27:45,248 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-12 21:27:45,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:45,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:45,250 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-12 21:27:45,251 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-12 21:27:45,252 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-12 21:27:45,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:27:45,262 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:27:45,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:27:45,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:27:45,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:27:45,264 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:27:45,264 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:27:45,265 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:27:45,275 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-12 21:27:45,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:45,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:45,277 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-12 21:27:45,277 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-12 21:27:45,278 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-12 21:27:45,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:27:45,288 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:27:45,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:27:45,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:27:45,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:27:45,289 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:27:45,289 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:27:45,290 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:27:45,301 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-12 21:27:45,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:45,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:45,302 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-12 21:27:45,303 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-12 21:27:45,304 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-12 21:27:45,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:27:45,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:27:45,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:27:45,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:27:45,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:27:45,316 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:27:45,316 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:27:45,317 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:27:45,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-12 21:27:45,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:45,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:45,330 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-12 21:27:45,330 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-12 21:27:45,332 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-12 21:27:45,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:27:45,344 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:27:45,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:27:45,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:27:45,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:27:45,345 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:27:45,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:27:45,347 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:27:45,356 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-12 21:27:45,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:45,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:45,358 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-12 21:27:45,359 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-12 21:27:45,360 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-12 21:27:45,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:27:45,370 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:27:45,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:27:45,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:27:45,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:27:45,371 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:27:45,371 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:27:45,373 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-12 21:27:45,375 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-12 21:27:45,375 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-12 21:27:45,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:45,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:45,377 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-12 21:27:45,378 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-12 21:27:45,379 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-12 21:27:45,379 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-12 21:27:45,379 INFO L474 LassoAnalysis]: Proved termination. [2024-11-12 21:27:45,379 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-12 21:27:45,390 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-12 21:27:45,392 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-12 21:27:45,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:45,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:45,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 21:27:45,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:27:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:45,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 21:27:45,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:27:45,766 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-12 21:27:45,768 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-12 21:27:45,769 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-12 21:27:45,801 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-12 21:27:45,802 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-12 21:27:45,802 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-12 21:27:45,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2024-11-12 21:27:45,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 2 letters. Loop has 93 letters. [2024-11-12 21:27:45,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:27:45,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 95 letters. Loop has 93 letters. [2024-11-12 21:27:45,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:27:45,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 2 letters. Loop has 186 letters. [2024-11-12 21:27:45,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:27:45,807 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 188 states and 203 transitions. [2024-11-12 21:27:45,808 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 25 [2024-11-12 21:27:45,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 188 states to 187 states and 202 transitions. [2024-11-12 21:27:45,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 [2024-11-12 21:27:45,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2024-11-12 21:27:45,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 187 states and 202 transitions. [2024-11-12 21:27:45,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 21:27:45,811 INFO L218 hiAutomatonCegarLoop]: Abstraction has 187 states and 202 transitions. [2024-11-12 21:27:45,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states and 202 transitions. [2024-11-12 21:27:45,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 111. [2024-11-12 21:27:45,820 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-12 21:27:45,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2024-11-12 21:27:45,820 INFO L240 hiAutomatonCegarLoop]: Abstraction has 111 states and 121 transitions. [2024-11-12 21:27:45,820 INFO L426 stractBuchiCegarLoop]: Abstraction has 111 states and 121 transitions. [2024-11-12 21:27:45,820 INFO L333 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-12 21:27:45,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 121 transitions. [2024-11-12 21:27:45,821 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-11-12 21:27:45,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:27:45,821 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:27:45,821 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-12 21:27:45,821 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 1, 1, 1] [2024-11-12 21:27:45,821 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "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;" "assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0;" [2024-11-12 21:27:45,821 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);" "main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" [2024-11-12 21:27:45,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:45,822 INFO L85 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2024-11-12 21:27:45,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:45,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704525451] [2024-11-12 21:27:45,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:45,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:45,828 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:27:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:45,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:27:45,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:45,833 INFO L85 PathProgramCache]: Analyzing trace with hash -706979195, now seen corresponding path program 1 times [2024-11-12 21:27:45,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:45,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547668332] [2024-11-12 21:27:45,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:45,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:45,847 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:27:45,853 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-12 21:27:45,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:45,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:27:45,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:45,857 INFO L85 PathProgramCache]: Analyzing trace with hash 855328031, now seen corresponding path program 1 times [2024-11-12 21:27:45,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:45,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652038980] [2024-11-12 21:27:45,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:45,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:45,861 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:27:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:45,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:27:45,906 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 21:27:45,906 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 21:27:45,906 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 21:27:45,906 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 21:27:45,906 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-12 21:27:45,906 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:45,906 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 21:27:45,906 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 21:27:45,906 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration9_Loop [2024-11-12 21:27:45,906 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 21:27:45,906 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 21:27:45,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:45,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:45,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:45,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:45,931 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 21:27:45,931 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-12 21:27:45,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:45,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:45,932 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-12 21:27:45,933 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-12 21:27:45,934 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:27:45,934 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:27:45,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-12 21:27:45,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:45,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:45,956 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-12 21:27:45,957 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-12 21:27:45,959 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-12 21:27:45,959 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:27:45,985 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-12 21:27:45,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-12 21:27:45,990 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 21:27:45,990 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 21:27:45,990 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 21:27:45,990 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 21:27:45,990 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-12 21:27:45,990 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:45,990 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 21:27:45,990 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 21:27:45,990 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration9_Loop [2024-11-12 21:27:45,990 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 21:27:45,990 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 21:27:45,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:45,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:46,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:46,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:46,027 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 21:27:46,027 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-12 21:27:46,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:46,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:46,030 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-12 21:27:46,038 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-12 21:27:46,039 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-12 21:27:46,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:27:46,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:27:46,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:27:46,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:27:46,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:27:46,051 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:27:46,051 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:27:46,052 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:27:46,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-12 21:27:46,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:46,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:46,065 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-12 21:27:46,065 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-12 21:27:46,067 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-12 21:27:46,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:27:46,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:27:46,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:27:46,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:27:46,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:27:46,078 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:27:46,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:27:46,080 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-12 21:27:46,085 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-12 21:27:46,085 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-12 21:27:46,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:46,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:46,103 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-12 21:27:46,104 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-12 21:27:46,105 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-12 21:27:46,105 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-12 21:27:46,105 INFO L474 LassoAnalysis]: Proved termination. [2024-11-12 21:27:46,105 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-12 21:27:46,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-11-12 21:27:46,116 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-12 21:27:46,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:46,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:46,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 21:27:46,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:27:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:46,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 21:27:46,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:27:46,188 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-12 21:27:46,188 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-12 21:27:46,188 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-12 21:27:46,206 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-12 21:27:46,207 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-12 21:27:46,207 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-12 21:27:46,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2024-11-12 21:27:46,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 3 letters. Loop has 15 letters. [2024-11-12 21:27:46,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:27:46,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 18 letters. Loop has 15 letters. [2024-11-12 21:27:46,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:27:46,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 3 letters. Loop has 30 letters. [2024-11-12 21:27:46,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:27:46,208 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 320 states and 348 transitions. [2024-11-12 21:27:46,212 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-11-12 21:27:46,213 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 320 states to 233 states and 254 transitions. [2024-11-12 21:27:46,213 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-11-12 21:27:46,213 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2024-11-12 21:27:46,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 233 states and 254 transitions. [2024-11-12 21:27:46,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 21:27:46,213 INFO L218 hiAutomatonCegarLoop]: Abstraction has 233 states and 254 transitions. [2024-11-12 21:27:46,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states and 254 transitions. [2024-11-12 21:27:46,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 129. [2024-11-12 21:27:46,220 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-12 21:27:46,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 142 transitions. [2024-11-12 21:27:46,221 INFO L240 hiAutomatonCegarLoop]: Abstraction has 129 states and 142 transitions. [2024-11-12 21:27:46,221 INFO L426 stractBuchiCegarLoop]: Abstraction has 129 states and 142 transitions. [2024-11-12 21:27:46,221 INFO L333 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-12 21:27:46,221 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states and 142 transitions. [2024-11-12 21:27:46,221 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-11-12 21:27:46,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:27:46,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:27:46,222 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-12 21:27:46,222 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-12 21:27:46,222 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "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;" "assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0;" "assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0;" [2024-11-12 21:27:46,222 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" [2024-11-12 21:27:46,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:46,225 INFO L85 PathProgramCache]: Analyzing trace with hash 925771, now seen corresponding path program 1 times [2024-11-12 21:27:46,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:46,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711582505] [2024-11-12 21:27:46,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:46,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:46,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:46,228 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:27:46,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:46,235 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:27:46,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:46,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1795, now seen corresponding path program 1 times [2024-11-12 21:27:46,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:46,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322077998] [2024-11-12 21:27:46,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:46,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:46,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:46,237 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:27:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:46,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:27:46,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:46,241 INFO L85 PathProgramCache]: Analyzing trace with hash 889666765, now seen corresponding path program 1 times [2024-11-12 21:27:46,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:46,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250306604] [2024-11-12 21:27:46,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:46,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:46,243 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:27:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:46,250 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:27:46,260 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 21:27:46,260 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 21:27:46,260 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 21:27:46,260 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 21:27:46,260 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-12 21:27:46,260 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:46,260 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 21:27:46,260 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 21:27:46,261 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration10_Loop [2024-11-12 21:27:46,261 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 21:27:46,261 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 21:27:46,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:46,265 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:46,276 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 21:27:46,276 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-12 21:27:46,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:46,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:46,278 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-12 21:27:46,280 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-12 21:27:46,284 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:27:46,284 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:27:46,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-11-12 21:27:46,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:46,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:46,308 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-12 21:27:46,309 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-12 21:27:46,310 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-12 21:27:46,310 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:27:46,336 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-12 21:27:46,340 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-12 21:27:46,340 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 21:27:46,340 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 21:27:46,340 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 21:27:46,340 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 21:27:46,340 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-12 21:27:46,340 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:46,340 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 21:27:46,340 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 21:27:46,340 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration10_Loop [2024-11-12 21:27:46,340 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 21:27:46,340 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 21:27:46,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:46,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:46,358 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 21:27:46,358 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-12 21:27:46,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:46,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:46,359 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-12 21:27:46,361 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-12 21:27:46,361 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-12 21:27:46,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:27:46,371 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:27:46,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:27:46,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:27:46,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:27:46,372 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:27:46,372 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:27:46,373 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-12 21:27:46,375 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-12 21:27:46,375 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-12 21:27:46,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:46,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:46,377 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-12 21:27:46,378 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-12 21:27:46,378 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-12 21:27:46,378 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-12 21:27:46,378 INFO L474 LassoAnalysis]: Proved termination. [2024-11-12 21:27:46,378 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-12 21:27:46,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-11-12 21:27:46,390 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-12 21:27:46,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:46,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 21:27:46,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:27:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:46,410 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 21:27:46,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:27:46,420 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-12 21:27:46,421 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-12 21:27:46,421 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-12 21:27:46,436 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-12 21:27:46,437 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-12 21:27:46,437 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-12 21:27:46,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2024-11-12 21:27:46,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-12 21:27:46,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:27:46,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2024-11-12 21:27:46,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:27:46,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2024-11-12 21:27:46,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:27:46,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 180 states and 199 transitions. [2024-11-12 21:27:46,439 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-11-12 21:27:46,440 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 180 states to 160 states and 175 transitions. [2024-11-12 21:27:46,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-11-12 21:27:46,440 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-11-12 21:27:46,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 160 states and 175 transitions. [2024-11-12 21:27:46,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 21:27:46,440 INFO L218 hiAutomatonCegarLoop]: Abstraction has 160 states and 175 transitions. [2024-11-12 21:27:46,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states and 175 transitions. [2024-11-12 21:27:46,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 129. [2024-11-12 21:27:46,443 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-12 21:27:46,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 141 transitions. [2024-11-12 21:27:46,443 INFO L240 hiAutomatonCegarLoop]: Abstraction has 129 states and 141 transitions. [2024-11-12 21:27:46,443 INFO L426 stractBuchiCegarLoop]: Abstraction has 129 states and 141 transitions. [2024-11-12 21:27:46,444 INFO L333 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-12 21:27:46,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states and 141 transitions. [2024-11-12 21:27:46,444 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-11-12 21:27:46,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:27:46,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:27:46,445 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 2, 1, 1, 1, 1, 1] [2024-11-12 21:27:46,445 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-12 21:27:46,445 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "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;" "assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0;" "assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);" "main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0;" [2024-11-12 21:27:46,445 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" [2024-11-12 21:27:46,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:46,445 INFO L85 PathProgramCache]: Analyzing trace with hash 745365203, now seen corresponding path program 2 times [2024-11-12 21:27:46,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:46,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569650885] [2024-11-12 21:27:46,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:46,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:46,450 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:27:46,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:46,454 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:27:46,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:46,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1795, now seen corresponding path program 2 times [2024-11-12 21:27:46,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:46,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436098128] [2024-11-12 21:27:46,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:46,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:46,456 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:27:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:46,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:27:46,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:46,457 INFO L85 PathProgramCache]: Analyzing trace with hash -963577515, now seen corresponding path program 3 times [2024-11-12 21:27:46,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:46,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445708344] [2024-11-12 21:27:46,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:46,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:46,461 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:27:46,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:46,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:27:46,475 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 21:27:46,475 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 21:27:46,475 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 21:27:46,475 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 21:27:46,475 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-12 21:27:46,475 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:46,475 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 21:27:46,475 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 21:27:46,476 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration11_Loop [2024-11-12 21:27:46,476 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 21:27:46,476 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 21:27:46,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:46,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:46,494 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 21:27:46,494 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-12 21:27:46,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:46,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:46,496 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-12 21:27:46,497 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-12 21:27:46,498 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:27:46,498 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:27:46,509 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-12 21:27:46,509 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-12 21:27:46,519 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-12 21:27:46,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:46,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:46,520 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-12 21:27:46,524 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-12 21:27:46,525 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:27:46,525 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:27:46,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-12 21:27:46,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:46,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:46,553 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-12 21:27:46,555 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-12 21:27:46,555 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-12 21:27:46,555 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:27:46,582 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-12 21:27:46,587 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-12 21:27:46,587 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 21:27:46,587 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 21:27:46,587 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 21:27:46,587 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 21:27:46,587 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-12 21:27:46,587 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:46,587 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 21:27:46,587 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 21:27:46,587 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration11_Loop [2024-11-12 21:27:46,587 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 21:27:46,588 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 21:27:46,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:46,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:46,604 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 21:27:46,604 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-12 21:27:46,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:46,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:46,606 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-12 21:27:46,607 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-12 21:27:46,607 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-12 21:27:46,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:27:46,617 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:27:46,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:27:46,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:27:46,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:27:46,618 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:27:46,618 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:27:46,619 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-12 21:27:46,621 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-12 21:27:46,621 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-12 21:27:46,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:46,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:46,622 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-12 21:27:46,623 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-12 21:27:46,623 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-12 21:27:46,623 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-12 21:27:46,623 INFO L474 LassoAnalysis]: Proved termination. [2024-11-12 21:27:46,623 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-12 21:27:46,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-12 21:27:46,634 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-12 21:27:46,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:46,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 21:27:46,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:27:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:46,671 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 21:27:46,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:27:46,679 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-12 21:27:46,681 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-12 21:27:46,681 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-12 21:27:46,698 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-12 21:27:46,699 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-12 21:27:46,700 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-12 21:27:46,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2024-11-12 21:27:46,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 19 letters. Loop has 2 letters. [2024-11-12 21:27:46,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:27:46,700 INFO L683 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-12 21:27:46,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:46,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:46,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 21:27:46,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:27:46,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:46,736 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 21:27:46,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:27:46,744 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-12 21:27:46,745 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-12 21:27:46,745 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-12 21:27:46,757 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-12 21:27:46,757 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-12 21:27:46,758 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-12 21:27:46,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2024-11-12 21:27:46,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 19 letters. Loop has 2 letters. [2024-11-12 21:27:46,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:27:46,758 INFO L683 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-12 21:27:46,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:46,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 21:27:46,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:27:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:46,792 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 21:27:46,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:27:46,800 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-12 21:27:46,801 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-12 21:27:46,801 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-12 21:27:46,814 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-12 21:27:46,814 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-12 21:27:46,814 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-12 21:27:46,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2024-11-12 21:27:46,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 19 letters. Loop has 2 letters. [2024-11-12 21:27:46,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:27:46,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 21 letters. Loop has 2 letters. [2024-11-12 21:27:46,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:27:46,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 19 letters. Loop has 4 letters. [2024-11-12 21:27:46,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:27:46,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 200 states and 221 transitions. [2024-11-12 21:27:46,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-11-12 21:27:46,817 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 200 states to 112 states and 121 transitions. [2024-11-12 21:27:46,817 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-12 21:27:46,817 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-11-12 21:27:46,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 121 transitions. [2024-11-12 21:27:46,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 21:27:46,817 INFO L218 hiAutomatonCegarLoop]: Abstraction has 112 states and 121 transitions. [2024-11-12 21:27:46,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states and 121 transitions. [2024-11-12 21:27:46,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-11-12 21:27:46,819 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-12 21:27:46,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2024-11-12 21:27:46,819 INFO L240 hiAutomatonCegarLoop]: Abstraction has 111 states and 120 transitions. [2024-11-12 21:27:46,819 INFO L426 stractBuchiCegarLoop]: Abstraction has 111 states and 120 transitions. [2024-11-12 21:27:46,819 INFO L333 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-12 21:27:46,820 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 120 transitions. [2024-11-12 21:27:46,820 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-11-12 21:27:46,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:27:46,820 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:27:46,821 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [36, 36, 6, 6, 6, 2, 1, 1, 1, 1] [2024-11-12 21:27:46,821 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 1, 1, 1] [2024-11-12 21:27:46,822 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "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;" "assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0;" "assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);" "main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);" "main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);" "main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);" "main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);" "main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);" "main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" "assume !(main_~b~0#1 < 6);" "main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1;" "assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0;" [2024-11-12 21:27:46,822 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !!(main_~c~0#1 < 6);" "main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1;" "assume !(main_~c~0#1 < 6);" "main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1;" [2024-11-12 21:27:46,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:46,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1672375441, now seen corresponding path program 2 times [2024-11-12 21:27:46,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:46,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641448418] [2024-11-12 21:27:46,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:46,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:46,836 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:27:46,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:46,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:27:46,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:46,859 INFO L85 PathProgramCache]: Analyzing trace with hash -706979195, now seen corresponding path program 2 times [2024-11-12 21:27:46,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:46,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885994864] [2024-11-12 21:27:46,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:46,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:46,862 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:27:46,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:46,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:27:46,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:46,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1669350057, now seen corresponding path program 3 times [2024-11-12 21:27:46,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:27:46,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007221956] [2024-11-12 21:27:46,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:27:46,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:27:46,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:46,875 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:27:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:27:46,910 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:27:46,924 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-12 21:27:46,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-11-12 21:27:46,941 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-12 21:27:46,970 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 21:27:46,970 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 21:27:46,970 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 21:27:46,970 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 21:27:46,971 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-12 21:27:46,971 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:46,971 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 21:27:46,971 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 21:27:46,971 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration12_Loop [2024-11-12 21:27:46,971 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 21:27:46,971 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 21:27:46,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:46,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:46,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:46,978 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:46,998 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 21:27:46,998 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-12 21:27:46,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:46,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:46,999 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:27:47,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-12 21:27:47,001 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:27:47,001 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:27:47,012 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-12 21:27:47,012 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0#1=6} Honda state: {ULTIMATE.start_main_~c~0#1=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-12 21:27:47,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-11-12 21:27:47,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:47,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:47,024 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:27:47,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-12 21:27:47,026 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-12 21:27:47,026 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:27:47,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-11-12 21:27:47,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:47,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:47,049 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:27:47,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-12 21:27:47,051 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-12 21:27:47,051 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-12 21:27:47,077 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-12 21:27:47,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-11-12 21:27:47,082 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 21:27:47,082 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 21:27:47,082 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 21:27:47,082 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 21:27:47,082 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-12 21:27:47,082 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:47,082 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 21:27:47,082 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 21:27:47,082 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration12_Loop [2024-11-12 21:27:47,082 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 21:27:47,082 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 21:27:47,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:47,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:47,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:47,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:27:47,109 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 21:27:47,109 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-12 21:27:47,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:47,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:47,111 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:27:47,114 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-12 21:27:47,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-12 21:27:47,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:27:47,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:27:47,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:27:47,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:27:47,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:27:47,124 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:27:47,124 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:27:47,126 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-12 21:27:47,127 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-12 21:27:47,127 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-12 21:27:47,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:27:47,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:27:47,129 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:27:47,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-12 21:27:47,130 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-12 21:27:47,130 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-12 21:27:47,130 INFO L474 LassoAnalysis]: Proved termination. [2024-11-12 21:27:47,130 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-12 21:27:47,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-11-12 21:27:47,141 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-12 21:27:47,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:47,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:47,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 21:27:47,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:27:47,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:47,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 21:27:47,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:27:47,318 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-12 21:27:47,319 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-12 21:27:47,319 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-12 21:27:47,331 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-12 21:27:47,331 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-12 21:27:47,331 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-12 21:27:47,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2024-11-12 21:27:47,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 96 letters. Loop has 15 letters. [2024-11-12 21:27:47,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:27:47,332 INFO L683 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-12 21:27:47,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:47,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 21:27:47,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:27:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:47,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 21:27:47,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:27:47,508 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-12 21:27:47,509 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-12 21:27:47,509 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-12 21:27:47,520 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-12 21:27:47,520 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-12 21:27:47,520 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-12 21:27:47,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2024-11-12 21:27:47,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 96 letters. Loop has 15 letters. [2024-11-12 21:27:47,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:27:47,521 INFO L683 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-12 21:27:47,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:27:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:47,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 21:27:47,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:27:47,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:27:47,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 21:27:47,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:27:47,679 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-12 21:27:47,680 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-12 21:27:47,680 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-12 21:27:47,691 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-12 21:27:47,691 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-12 21:27:47,692 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-12 21:27:47,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2024-11-12 21:27:47,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 96 letters. Loop has 15 letters. [2024-11-12 21:27:47,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:27:47,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 111 letters. Loop has 15 letters. [2024-11-12 21:27:47,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:27:47,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 96 letters. Loop has 30 letters. [2024-11-12 21:27:47,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:27:47,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 212 states and 230 transitions. [2024-11-12 21:27:47,694 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-12 21:27:47,695 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 212 states to 0 states and 0 transitions. [2024-11-12 21:27:47,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-12 21:27:47,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-12 21:27:47,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-12 21:27:47,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:27:47,695 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 21:27:47,695 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 21:27:47,695 INFO L426 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 21:27:47,695 INFO L333 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-12 21:27:47,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-12 21:27:47,695 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-12 21:27:47,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-12 21:27:47,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.11 09:27:47 BoogieIcfgContainer [2024-11-12 21:27:47,702 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-12 21:27:47,703 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 21:27:47,703 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 21:27:47,703 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 21:27:47,703 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 09:27:42" (3/4) ... [2024-11-12 21:27:47,705 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 21:27:47,707 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 21:27:47,707 INFO L158 Benchmark]: Toolchain (without parser) took 5664.74ms. Allocated memory was 167.8MB in the beginning and 203.4MB in the end (delta: 35.7MB). Free memory was 111.7MB in the beginning and 75.3MB in the end (delta: 36.4MB). Peak memory consumption was 70.5MB. Max. memory is 16.1GB. [2024-11-12 21:27:47,707 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 96.5MB. Free memory is still 50.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 21:27:47,708 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.53ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 140.7MB in the end (delta: -29.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 21:27:47,708 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.63ms. Allocated memory is still 167.8MB. Free memory was 140.7MB in the beginning and 139.8MB in the end (delta: 935.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 21:27:47,708 INFO L158 Benchmark]: Boogie Preprocessor took 25.77ms. Allocated memory is still 167.8MB. Free memory was 139.8MB in the beginning and 137.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 21:27:47,708 INFO L158 Benchmark]: RCFGBuilder took 248.33ms. Allocated memory is still 167.8MB. Free memory was 137.7MB in the beginning and 128.2MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-12 21:27:47,708 INFO L158 Benchmark]: BuchiAutomizer took 5147.49ms. Allocated memory was 167.8MB in the beginning and 203.4MB in the end (delta: 35.7MB). Free memory was 127.2MB in the beginning and 76.4MB in the end (delta: 50.8MB). Peak memory consumption was 89.4MB. Max. memory is 16.1GB. [2024-11-12 21:27:47,709 INFO L158 Benchmark]: Witness Printer took 3.86ms. Allocated memory is still 203.4MB. Free memory was 76.4MB in the beginning and 75.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 21:27:47,711 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.14ms. Allocated memory is still 96.5MB. Free memory is still 50.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 205.53ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 140.7MB in the end (delta: -29.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.63ms. Allocated memory is still 167.8MB. Free memory was 140.7MB in the beginning and 139.8MB in the end (delta: 935.6kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.77ms. Allocated memory is still 167.8MB. Free memory was 139.8MB in the beginning and 137.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 248.33ms. Allocated memory is still 167.8MB. Free memory was 137.7MB in the beginning and 128.2MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 5147.49ms. Allocated memory was 167.8MB in the beginning and 203.4MB in the end (delta: 35.7MB). Free memory was 127.2MB in the beginning and 76.4MB in the end (delta: 50.8MB). Peak memory consumption was 89.4MB. Max. memory is 16.1GB. * Witness Printer took 3.86ms. Allocated memory is still 203.4MB. Free memory was 76.4MB in the beginning and 75.3MB 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 12 terminating modules (7 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. 7 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.0s and 13 iterations. TraceHistogramMax:36. Analysis of lassos took 3.4s. Construction of modules took 0.1s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 8. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 254 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, 202 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 193 mSDsluCounter, 272 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 131 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 155 IncrementalHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 141 mSDtfsCounter, 155 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI7 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: 17ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 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-12 21:27:47,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-11-12 21:27:47,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-12 21:27:48,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-12 21:27:48,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-12 21:27:48,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-12 21:27:48,733 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-12 21:27:48,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-12 21:27:49,133 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-12 21:27:49,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE