./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_4.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 fcf77da5263056f8d62c4caf3b92919690d80ef4ff864a75d0d8d1eec10bdccf --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-15 00:43:27,594 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 00:43:27,664 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-15 00:43:27,668 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 00:43:27,669 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 00:43:27,688 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 00:43:27,689 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 00:43:27,689 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 00:43:27,690 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 00:43:27,690 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 00:43:27,691 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 00:43:27,691 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 00:43:27,692 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 00:43:27,692 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-15 00:43:27,692 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-15 00:43:27,693 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-15 00:43:27,693 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-15 00:43:27,693 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-15 00:43:27,694 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-15 00:43:27,694 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 00:43:27,695 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-15 00:43:27,695 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 00:43:27,696 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 00:43:27,696 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 00:43:27,696 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 00:43:27,696 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-15 00:43:27,697 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-15 00:43:27,697 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-15 00:43:27,697 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 00:43:27,697 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-15 00:43:27,697 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 00:43:27,698 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 00:43:27,698 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-15 00:43:27,698 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 00:43:27,698 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 00:43:27,699 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 00:43:27,699 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 00:43:27,700 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 00:43:27,700 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-15 00:43:27,700 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 -> fcf77da5263056f8d62c4caf3b92919690d80ef4ff864a75d0d8d1eec10bdccf [2024-10-15 00:43:27,949 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 00:43:27,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 00:43:27,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 00:43:27,983 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 00:43:27,983 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 00:43:27,984 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_4.c [2024-10-15 00:43:29,468 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 00:43:29,671 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 00:43:29,672 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_4.c [2024-10-15 00:43:29,680 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f88561e80/9052a2e149a84d27b9a8d4cf3f9abd1d/FLAG9241732c4 [2024-10-15 00:43:29,700 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f88561e80/9052a2e149a84d27b9a8d4cf3f9abd1d [2024-10-15 00:43:29,704 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 00:43:29,706 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 00:43:29,707 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 00:43:29,707 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 00:43:29,714 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 00:43:29,715 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:43:29" (1/1) ... [2024-10-15 00:43:29,716 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b9a53a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:29, skipping insertion in model container [2024-10-15 00:43:29,716 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:43:29" (1/1) ... [2024-10-15 00:43:29,740 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 00:43:29,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:43:29,947 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 00:43:29,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:43:30,019 INFO L204 MainTranslator]: Completed translation [2024-10-15 00:43:30,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:30 WrapperNode [2024-10-15 00:43:30,024 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 00:43:30,025 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 00:43:30,025 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 00:43:30,025 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 00:43:30,042 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:30" (1/1) ... [2024-10-15 00:43:30,053 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:30" (1/1) ... [2024-10-15 00:43:30,122 INFO L138 Inliner]: procedures = 10, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 50 [2024-10-15 00:43:30,122 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 00:43:30,123 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 00:43:30,126 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 00:43:30,127 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 00:43:30,138 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:30" (1/1) ... [2024-10-15 00:43:30,139 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:30" (1/1) ... [2024-10-15 00:43:30,144 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:30" (1/1) ... [2024-10-15 00:43:30,160 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-15 00:43:30,160 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:30" (1/1) ... [2024-10-15 00:43:30,160 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:30" (1/1) ... [2024-10-15 00:43:30,163 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:30" (1/1) ... [2024-10-15 00:43:30,172 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:30" (1/1) ... [2024-10-15 00:43:30,173 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:30" (1/1) ... [2024-10-15 00:43:30,174 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:30" (1/1) ... [2024-10-15 00:43:30,175 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 00:43:30,178 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 00:43:30,179 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 00:43:30,179 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 00:43:30,180 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:30" (1/1) ... [2024-10-15 00:43:30,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:30,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:30,218 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-10-15 00:43:30,226 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-10-15 00:43:30,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 00:43:30,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 00:43:30,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 00:43:30,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 00:43:30,330 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 00:43:30,332 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 00:43:30,435 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-10-15 00:43:30,435 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 00:43:30,452 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 00:43:30,453 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-15 00:43:30,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:43:30 BoogieIcfgContainer [2024-10-15 00:43:30,454 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 00:43:30,455 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-15 00:43:30,455 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-15 00:43:30,459 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-15 00:43:30,460 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:43:30,462 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.10 12:43:29" (1/3) ... [2024-10-15 00:43:30,463 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54fc77e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:43:30, skipping insertion in model container [2024-10-15 00:43:30,463 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:43:30,463 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:30" (2/3) ... [2024-10-15 00:43:30,463 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54fc77e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:43:30, skipping insertion in model container [2024-10-15 00:43:30,464 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:43:30,464 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:43:30" (3/3) ... [2024-10-15 00:43:30,465 INFO L332 chiAutomizerObserver]: Analyzing ICFG nested_4.c [2024-10-15 00:43:30,521 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-15 00:43:30,521 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-15 00:43:30,521 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-15 00:43:30,521 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-15 00:43:30,521 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-15 00:43:30,521 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-15 00:43:30,522 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-15 00:43:30,522 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-15 00:43:30,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:43:30,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-15 00:43:30,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:43:30,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:43:30,551 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:43:30,552 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:43:30,552 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-15 00:43:30,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:43:30,554 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-15 00:43:30,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:43:30,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:43:30,554 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:43:30,555 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:43:30,562 INFO L745 eck$LassoCheckResult]: Stem: 12#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0; 13#L22-3true [2024-10-15 00:43:30,562 INFO L747 eck$LassoCheckResult]: Loop: 13#L22-3true assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 14#L23-3true assume !(main_~b~0#1 < 6); 7#L22-2true main_#t~pre7#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre7#1; 13#L22-3true [2024-10-15 00:43:30,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:30,569 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-15 00:43:30,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:30,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904919126] [2024-10-15 00:43:30,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:30,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:30,680 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:43:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:30,716 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:43:30,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:30,721 INFO L85 PathProgramCache]: Analyzing trace with hash 39945, now seen corresponding path program 1 times [2024-10-15 00:43:30,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:30,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675558437] [2024-10-15 00:43:30,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:30,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:30,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:43:30,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:43:30,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:43:30,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675558437] [2024-10-15 00:43:30,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675558437] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:43:30,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:43:30,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-15 00:43:30,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634085261] [2024-10-15 00:43:30,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:43:30,817 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:43:30,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:43:30,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:43:30,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:43:30,856 INFO L87 Difference]: Start difference. First operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:43:30,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:43:30,891 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2024-10-15 00:43:30,892 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2024-10-15 00:43:30,894 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-10-15 00:43:30,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 21 transitions. [2024-10-15 00:43:30,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-10-15 00:43:30,900 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-10-15 00:43:30,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2024-10-15 00:43:30,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:43:30,902 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 21 transitions. [2024-10-15 00:43:30,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2024-10-15 00:43:30,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2024-10-15 00:43:30,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:43:30,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2024-10-15 00:43:30,928 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 14 transitions. [2024-10-15 00:43:30,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:43:30,934 INFO L425 stractBuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2024-10-15 00:43:30,935 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-15 00:43:30,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2024-10-15 00:43:30,937 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-10-15 00:43:30,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:43:30,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:43:30,938 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:43:30,938 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:43:30,938 INFO L745 eck$LassoCheckResult]: Stem: 52#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 53#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0; 55#L22-3 [2024-10-15 00:43:30,938 INFO L747 eck$LassoCheckResult]: Loop: 55#L22-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 54#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 49#L24-3 assume !(main_~c~0#1 < 6); 50#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 51#L23-3 assume !(main_~b~0#1 < 6); 56#L22-2 main_#t~pre7#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre7#1; 55#L22-3 [2024-10-15 00:43:30,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:30,940 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-10-15 00:43:30,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:30,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959038896] [2024-10-15 00:43:30,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:30,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:30,954 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:43:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:30,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:43:30,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:30,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1191176381, now seen corresponding path program 1 times [2024-10-15 00:43:30,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:30,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534208124] [2024-10-15 00:43:30,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:30,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:30,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:43:31,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:43:31,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:43:31,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534208124] [2024-10-15 00:43:31,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534208124] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:43:31,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:43:31,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 00:43:31,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471750644] [2024-10-15 00:43:31,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:43:31,006 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:43:31,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:43:31,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:43:31,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:43:31,007 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. cyclomatic complexity: 4 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-10-15 00:43:31,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:43:31,025 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2024-10-15 00:43:31,025 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2024-10-15 00:43:31,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-10-15 00:43:31,026 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2024-10-15 00:43:31,026 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-10-15 00:43:31,027 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-10-15 00:43:31,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2024-10-15 00:43:31,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:43:31,027 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2024-10-15 00:43:31,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2024-10-15 00:43:31,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2024-10-15 00:43:31,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:43:31,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2024-10-15 00:43:31,030 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 15 transitions. [2024-10-15 00:43:31,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:43:31,032 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2024-10-15 00:43:31,032 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-15 00:43:31,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2024-10-15 00:43:31,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2024-10-15 00:43:31,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:43:31,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:43:31,034 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:43:31,035 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:43:31,035 INFO L745 eck$LassoCheckResult]: Stem: 84#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 85#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0; 86#L22-3 [2024-10-15 00:43:31,036 INFO L747 eck$LassoCheckResult]: Loop: 86#L22-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 87#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 88#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 79#L25-3 assume !(main_~d~0#1 < 6); 80#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 81#L24-3 assume !(main_~c~0#1 < 6); 82#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 83#L23-3 assume !(main_~b~0#1 < 6); 89#L22-2 main_#t~pre7#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre7#1; 86#L22-3 [2024-10-15 00:43:31,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:31,037 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-10-15 00:43:31,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:31,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617482502] [2024-10-15 00:43:31,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:31,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:31,048 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:43:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:31,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:43:31,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:31,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1526250579, now seen corresponding path program 1 times [2024-10-15 00:43:31,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:31,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511817361] [2024-10-15 00:43:31,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:31,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:31,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:43:31,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:43:31,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:43:31,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511817361] [2024-10-15 00:43:31,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511817361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:43:31,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:43:31,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 00:43:31,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076241484] [2024-10-15 00:43:31,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:43:31,096 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:43:31,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:43:31,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:43:31,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:43:31,097 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:43:31,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:43:31,106 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2024-10-15 00:43:31,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2024-10-15 00:43:31,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-10-15 00:43:31,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 17 transitions. [2024-10-15 00:43:31,108 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-10-15 00:43:31,108 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-15 00:43:31,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2024-10-15 00:43:31,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:43:31,108 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 17 transitions. [2024-10-15 00:43:31,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2024-10-15 00:43:31,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2024-10-15 00:43:31,109 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-10-15 00:43:31,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2024-10-15 00:43:31,110 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-10-15 00:43:31,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:43:31,111 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-10-15 00:43:31,111 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-15 00:43:31,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2024-10-15 00:43:31,112 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2024-10-15 00:43:31,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:43:31,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:43:31,113 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:43:31,113 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:43:31,113 INFO L745 eck$LassoCheckResult]: Stem: 117#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 118#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0; 119#L22-3 [2024-10-15 00:43:31,113 INFO L747 eck$LassoCheckResult]: Loop: 119#L22-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 120#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 121#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 116#L25-3 assume !!(main_~d~0#1 < 6); 110#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 111#L25-3 assume !(main_~d~0#1 < 6); 112#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 113#L24-3 assume !(main_~c~0#1 < 6); 114#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 115#L23-3 assume !(main_~b~0#1 < 6); 122#L22-2 main_#t~pre7#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre7#1; 119#L22-3 [2024-10-15 00:43:31,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:31,114 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-10-15 00:43:31,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:31,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278675191] [2024-10-15 00:43:31,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:31,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:31,120 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:43:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:31,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:43:31,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:31,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1981778385, now seen corresponding path program 1 times [2024-10-15 00:43:31,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:31,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400636594] [2024-10-15 00:43:31,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:31,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:43:31,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:43:31,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:43:31,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400636594] [2024-10-15 00:43:31,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400636594] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:43:31,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010455218] [2024-10-15 00:43:31,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:31,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:43:31,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:31,211 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-10-15 00:43:31,213 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-10-15 00:43:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:43:31,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-15 00:43:31,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:43:31,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:43:31,300 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:43:31,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:43:31,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010455218] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:43:31,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:43:31,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-10-15 00:43:31,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104806171] [2024-10-15 00:43:31,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:43:31,328 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:43:31,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:43:31,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 00:43:31,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-15 00:43:31,329 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. cyclomatic complexity: 4 Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:43:31,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:43:31,355 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2024-10-15 00:43:31,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 22 transitions. [2024-10-15 00:43:31,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2024-10-15 00:43:31,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 22 transitions. [2024-10-15 00:43:31,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-10-15 00:43:31,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-10-15 00:43:31,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2024-10-15 00:43:31,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:43:31,357 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-10-15 00:43:31,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2024-10-15 00:43:31,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-10-15 00:43:31,359 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-10-15 00:43:31,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-10-15 00:43:31,360 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-10-15 00:43:31,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 00:43:31,361 INFO L425 stractBuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-10-15 00:43:31,361 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-15 00:43:31,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2024-10-15 00:43:31,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2024-10-15 00:43:31,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:43:31,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:43:31,364 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:43:31,365 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:43:31,365 INFO L745 eck$LassoCheckResult]: Stem: 218#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 219#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0; 220#L22-3 [2024-10-15 00:43:31,365 INFO L747 eck$LassoCheckResult]: Loop: 220#L22-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 221#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 222#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 217#L25-3 assume !!(main_~d~0#1 < 6); 211#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 212#L25-3 assume !!(main_~d~0#1 < 6); 229#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 228#L25-3 assume !!(main_~d~0#1 < 6); 227#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 226#L25-3 assume !!(main_~d~0#1 < 6); 225#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 224#L25-3 assume !(main_~d~0#1 < 6); 213#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 214#L24-3 assume !(main_~c~0#1 < 6); 215#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 216#L23-3 assume !(main_~b~0#1 < 6); 223#L22-2 main_#t~pre7#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre7#1; 220#L22-3 [2024-10-15 00:43:31,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:31,366 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-10-15 00:43:31,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:31,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367295599] [2024-10-15 00:43:31,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:31,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:31,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:31,380 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:43:31,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:31,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:43:31,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:31,393 INFO L85 PathProgramCache]: Analyzing trace with hash 669317813, now seen corresponding path program 2 times [2024-10-15 00:43:31,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:31,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426921838] [2024-10-15 00:43:31,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:31,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:31,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:43:31,452 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-15 00:43:31,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:43:31,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426921838] [2024-10-15 00:43:31,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426921838] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:43:31,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556342971] [2024-10-15 00:43:31,453 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 00:43:31,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:43:31,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:31,474 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-10-15 00:43:31,475 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-10-15 00:43:31,514 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 00:43:31,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:43:31,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-15 00:43:31,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:43:31,574 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:43:31,575 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:43:31,638 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:43:31,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556342971] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:43:31,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:43:31,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 10 [2024-10-15 00:43:31,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375820887] [2024-10-15 00:43:31,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:43:31,639 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:43:31,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:43:31,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-15 00:43:31,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-15 00:43:31,642 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. cyclomatic complexity: 4 Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 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-10-15 00:43:31,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:43:31,820 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2024-10-15 00:43:31,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 57 transitions. [2024-10-15 00:43:31,824 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2024-10-15 00:43:31,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 57 transitions. [2024-10-15 00:43:31,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2024-10-15 00:43:31,825 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2024-10-15 00:43:31,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 57 transitions. [2024-10-15 00:43:31,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:43:31,826 INFO L218 hiAutomatonCegarLoop]: Abstraction has 52 states and 57 transitions. [2024-10-15 00:43:31,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 57 transitions. [2024-10-15 00:43:31,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 38. [2024-10-15 00:43:31,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.105263157894737) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:43:31,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-10-15 00:43:31,830 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-10-15 00:43:31,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-15 00:43:31,831 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-10-15 00:43:31,831 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-15 00:43:31,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 42 transitions. [2024-10-15 00:43:31,832 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2024-10-15 00:43:31,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:43:31,832 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:43:31,833 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:43:31,833 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-15 00:43:31,833 INFO L745 eck$LassoCheckResult]: Stem: 422#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 423#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0; 426#L22-3 [2024-10-15 00:43:31,833 INFO L747 eck$LassoCheckResult]: Loop: 426#L22-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 424#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 425#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 443#L25-3 assume !!(main_~d~0#1 < 6); 442#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 441#L25-3 assume !!(main_~d~0#1 < 6); 440#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 439#L25-3 assume !!(main_~d~0#1 < 6); 438#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 437#L25-3 assume !!(main_~d~0#1 < 6); 436#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 435#L25-3 assume !!(main_~d~0#1 < 6); 434#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 433#L25-3 assume !!(main_~d~0#1 < 6); 432#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 431#L25-3 assume !(main_~d~0#1 < 6); 417#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 418#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 427#L25-3 assume !!(main_~d~0#1 < 6); 415#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 416#L25-3 assume !!(main_~d~0#1 < 6); 421#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 452#L25-3 assume !!(main_~d~0#1 < 6); 451#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 450#L25-3 assume !!(main_~d~0#1 < 6); 449#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 448#L25-3 assume !!(main_~d~0#1 < 6); 447#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 446#L25-3 assume !!(main_~d~0#1 < 6); 445#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 444#L25-3 assume !(main_~d~0#1 < 6); 430#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 429#L24-3 assume !(main_~c~0#1 < 6); 419#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 420#L23-3 assume !(main_~b~0#1 < 6); 428#L22-2 main_#t~pre7#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre7#1; 426#L22-3 [2024-10-15 00:43:31,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:31,834 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2024-10-15 00:43:31,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:31,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857161546] [2024-10-15 00:43:31,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:31,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:31,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:31,841 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:43:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:31,850 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:43:31,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:31,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1141890755, now seen corresponding path program 3 times [2024-10-15 00:43:31,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:31,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582983529] [2024-10-15 00:43:31,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:31,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:43:31,961 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2024-10-15 00:43:31,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:43:31,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582983529] [2024-10-15 00:43:31,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582983529] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:43:31,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198086940] [2024-10-15 00:43:31,962 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-15 00:43:31,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:43:31,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:31,964 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-10-15 00:43:31,966 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-10-15 00:43:32,001 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-15 00:43:32,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:43:32,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-15 00:43:32,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:43:32,108 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2024-10-15 00:43:32,108 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:43:32,185 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2024-10-15 00:43:32,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198086940] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:43:32,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:43:32,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-10-15 00:43:32,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614031726] [2024-10-15 00:43:32,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:43:32,186 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:43:32,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:43:32,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 00:43:32,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-15 00:43:32,187 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. cyclomatic complexity: 5 Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:43:32,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:43:32,212 INFO L93 Difference]: Finished difference Result 137 states and 150 transitions. [2024-10-15 00:43:32,212 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 150 transitions. [2024-10-15 00:43:32,214 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 135 [2024-10-15 00:43:32,215 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 137 states and 150 transitions. [2024-10-15 00:43:32,215 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2024-10-15 00:43:32,216 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2024-10-15 00:43:32,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 150 transitions. [2024-10-15 00:43:32,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:43:32,217 INFO L218 hiAutomatonCegarLoop]: Abstraction has 137 states and 150 transitions. [2024-10-15 00:43:32,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 150 transitions. [2024-10-15 00:43:32,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-10-15 00:43:32,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 137 states have (on average 1.094890510948905) internal successors, (150), 136 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:43:32,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 150 transitions. [2024-10-15 00:43:32,226 INFO L240 hiAutomatonCegarLoop]: Abstraction has 137 states and 150 transitions. [2024-10-15 00:43:32,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 00:43:32,229 INFO L425 stractBuchiCegarLoop]: Abstraction has 137 states and 150 transitions. [2024-10-15 00:43:32,229 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-15 00:43:32,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 150 transitions. [2024-10-15 00:43:32,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 135 [2024-10-15 00:43:32,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:43:32,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:43:32,235 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:43:32,235 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [48, 48, 8, 8, 8, 4, 4, 4, 1, 1, 1] [2024-10-15 00:43:32,235 INFO L745 eck$LassoCheckResult]: Stem: 816#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 817#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0; 820#L22-3 [2024-10-15 00:43:32,236 INFO L747 eck$LassoCheckResult]: Loop: 820#L22-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 818#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 819#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 815#L25-3 assume !!(main_~d~0#1 < 6); 809#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 810#L25-3 assume !!(main_~d~0#1 < 6); 941#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 939#L25-3 assume !!(main_~d~0#1 < 6); 937#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 935#L25-3 assume !!(main_~d~0#1 < 6); 933#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 931#L25-3 assume !!(main_~d~0#1 < 6); 929#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 927#L25-3 assume !!(main_~d~0#1 < 6); 925#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 924#L25-3 assume !(main_~d~0#1 < 6); 811#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 812#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 893#L25-3 assume !!(main_~d~0#1 < 6); 919#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 917#L25-3 assume !!(main_~d~0#1 < 6); 915#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 913#L25-3 assume !!(main_~d~0#1 < 6); 911#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 909#L25-3 assume !!(main_~d~0#1 < 6); 907#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 905#L25-3 assume !!(main_~d~0#1 < 6); 903#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 901#L25-3 assume !!(main_~d~0#1 < 6); 899#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 898#L25-3 assume !(main_~d~0#1 < 6); 895#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 892#L24-3 assume !(main_~c~0#1 < 6); 813#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 814#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 945#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 944#L25-3 assume !!(main_~d~0#1 < 6); 943#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 942#L25-3 assume !!(main_~d~0#1 < 6); 940#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 938#L25-3 assume !!(main_~d~0#1 < 6); 936#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 934#L25-3 assume !!(main_~d~0#1 < 6); 932#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 930#L25-3 assume !!(main_~d~0#1 < 6); 928#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 926#L25-3 assume !!(main_~d~0#1 < 6); 923#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 922#L25-3 assume !(main_~d~0#1 < 6); 921#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 920#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 891#L25-3 assume !!(main_~d~0#1 < 6); 918#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 916#L25-3 assume !!(main_~d~0#1 < 6); 914#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 912#L25-3 assume !!(main_~d~0#1 < 6); 910#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 908#L25-3 assume !!(main_~d~0#1 < 6); 906#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 904#L25-3 assume !!(main_~d~0#1 < 6); 902#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 900#L25-3 assume !!(main_~d~0#1 < 6); 897#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 896#L25-3 assume !(main_~d~0#1 < 6); 894#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 890#L24-3 assume !(main_~c~0#1 < 6); 889#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 888#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 887#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 886#L25-3 assume !!(main_~d~0#1 < 6); 885#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 884#L25-3 assume !!(main_~d~0#1 < 6); 883#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 882#L25-3 assume !!(main_~d~0#1 < 6); 881#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 880#L25-3 assume !!(main_~d~0#1 < 6); 879#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 878#L25-3 assume !!(main_~d~0#1 < 6); 877#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 876#L25-3 assume !!(main_~d~0#1 < 6); 875#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 874#L25-3 assume !(main_~d~0#1 < 6); 873#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 872#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 858#L25-3 assume !!(main_~d~0#1 < 6); 871#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 870#L25-3 assume !!(main_~d~0#1 < 6); 869#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 868#L25-3 assume !!(main_~d~0#1 < 6); 867#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 866#L25-3 assume !!(main_~d~0#1 < 6); 865#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 864#L25-3 assume !!(main_~d~0#1 < 6); 863#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 862#L25-3 assume !!(main_~d~0#1 < 6); 861#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 860#L25-3 assume !(main_~d~0#1 < 6); 859#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 857#L24-3 assume !(main_~c~0#1 < 6); 856#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 855#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 823#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 854#L25-3 assume !!(main_~d~0#1 < 6); 853#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 852#L25-3 assume !!(main_~d~0#1 < 6); 851#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 850#L25-3 assume !!(main_~d~0#1 < 6); 849#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 848#L25-3 assume !!(main_~d~0#1 < 6); 847#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 846#L25-3 assume !!(main_~d~0#1 < 6); 845#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 844#L25-3 assume !!(main_~d~0#1 < 6); 843#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 842#L25-3 assume !(main_~d~0#1 < 6); 841#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 840#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 826#L25-3 assume !!(main_~d~0#1 < 6); 839#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 838#L25-3 assume !!(main_~d~0#1 < 6); 837#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 836#L25-3 assume !!(main_~d~0#1 < 6); 835#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 834#L25-3 assume !!(main_~d~0#1 < 6); 833#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 832#L25-3 assume !!(main_~d~0#1 < 6); 831#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 830#L25-3 assume !!(main_~d~0#1 < 6); 829#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 828#L25-3 assume !(main_~d~0#1 < 6); 827#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 825#L24-3 assume !(main_~c~0#1 < 6); 824#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 822#L23-3 assume !(main_~b~0#1 < 6); 821#L22-2 main_#t~pre7#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre7#1; 820#L22-3 [2024-10-15 00:43:32,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:32,236 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2024-10-15 00:43:32,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:32,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217263830] [2024-10-15 00:43:32,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:32,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:32,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:32,250 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:43:32,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:32,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:43:32,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:32,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1405490935, now seen corresponding path program 4 times [2024-10-15 00:43:32,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:32,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17045022] [2024-10-15 00:43:32,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:32,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:43:32,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2778 backedges. 1063 proven. 89 refuted. 0 times theorem prover too weak. 1626 trivial. 0 not checked. [2024-10-15 00:43:32,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:43:32,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17045022] [2024-10-15 00:43:32,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17045022] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:43:32,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101002773] [2024-10-15 00:43:32,432 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-15 00:43:32,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:43:32,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:32,434 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-10-15 00:43:32,436 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-10-15 00:43:32,513 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-15 00:43:32,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:43:32,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:43:32,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:43:32,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2778 backedges. 1063 proven. 89 refuted. 0 times theorem prover too weak. 1626 trivial. 0 not checked. [2024-10-15 00:43:32,583 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:43:32,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2778 backedges. 1063 proven. 89 refuted. 0 times theorem prover too weak. 1626 trivial. 0 not checked. [2024-10-15 00:43:32,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101002773] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:43:32,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:43:32,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-15 00:43:32,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171016731] [2024-10-15 00:43:32,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:43:32,670 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:43:32,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:43:32,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-15 00:43:32,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-10-15 00:43:32,674 INFO L87 Difference]: Start difference. First operand 137 states and 150 transitions. cyclomatic complexity: 14 Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:43:32,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:43:32,710 INFO L93 Difference]: Finished difference Result 377 states and 406 transitions. [2024-10-15 00:43:32,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 377 states and 406 transitions. [2024-10-15 00:43:32,715 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 375 [2024-10-15 00:43:32,718 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 377 states to 377 states and 406 transitions. [2024-10-15 00:43:32,718 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 377 [2024-10-15 00:43:32,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 377 [2024-10-15 00:43:32,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 377 states and 406 transitions. [2024-10-15 00:43:32,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:43:32,721 INFO L218 hiAutomatonCegarLoop]: Abstraction has 377 states and 406 transitions. [2024-10-15 00:43:32,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states and 406 transitions. [2024-10-15 00:43:32,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2024-10-15 00:43:32,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 377 states have (on average 1.0769230769230769) internal successors, (406), 376 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:43:32,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 406 transitions. [2024-10-15 00:43:32,747 INFO L240 hiAutomatonCegarLoop]: Abstraction has 377 states and 406 transitions. [2024-10-15 00:43:32,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 00:43:32,748 INFO L425 stractBuchiCegarLoop]: Abstraction has 377 states and 406 transitions. [2024-10-15 00:43:32,748 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-15 00:43:32,748 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 377 states and 406 transitions. [2024-10-15 00:43:32,751 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 375 [2024-10-15 00:43:32,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:43:32,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:43:32,755 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:43:32,755 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [144, 144, 24, 24, 24, 4, 4, 4, 1, 1, 1] [2024-10-15 00:43:32,755 INFO L745 eck$LassoCheckResult]: Stem: 2145#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 2146#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0; 2149#L22-3 [2024-10-15 00:43:32,756 INFO L747 eck$LassoCheckResult]: Loop: 2149#L22-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 2147#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 2148#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2144#L25-3 assume !!(main_~d~0#1 < 6); 2138#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2139#L25-3 assume !!(main_~d~0#1 < 6); 2510#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2508#L25-3 assume !!(main_~d~0#1 < 6); 2506#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2504#L25-3 assume !!(main_~d~0#1 < 6); 2502#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2500#L25-3 assume !!(main_~d~0#1 < 6); 2498#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2496#L25-3 assume !!(main_~d~0#1 < 6); 2494#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2493#L25-3 assume !(main_~d~0#1 < 6); 2140#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2141#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2488#L25-3 assume !!(main_~d~0#1 < 6); 2486#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2484#L25-3 assume !!(main_~d~0#1 < 6); 2482#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2480#L25-3 assume !!(main_~d~0#1 < 6); 2478#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2476#L25-3 assume !!(main_~d~0#1 < 6); 2474#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2472#L25-3 assume !!(main_~d~0#1 < 6); 2470#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2468#L25-3 assume !!(main_~d~0#1 < 6); 2466#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2465#L25-3 assume !(main_~d~0#1 < 6); 2462#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2460#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2458#L25-3 assume !!(main_~d~0#1 < 6); 2456#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2454#L25-3 assume !!(main_~d~0#1 < 6); 2452#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2450#L25-3 assume !!(main_~d~0#1 < 6); 2448#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2446#L25-3 assume !!(main_~d~0#1 < 6); 2444#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2442#L25-3 assume !!(main_~d~0#1 < 6); 2440#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2438#L25-3 assume !!(main_~d~0#1 < 6); 2436#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2435#L25-3 assume !(main_~d~0#1 < 6); 2432#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2430#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2428#L25-3 assume !!(main_~d~0#1 < 6); 2426#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2424#L25-3 assume !!(main_~d~0#1 < 6); 2422#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2420#L25-3 assume !!(main_~d~0#1 < 6); 2418#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2416#L25-3 assume !!(main_~d~0#1 < 6); 2414#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2412#L25-3 assume !!(main_~d~0#1 < 6); 2410#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2408#L25-3 assume !!(main_~d~0#1 < 6); 2406#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2405#L25-3 assume !(main_~d~0#1 < 6); 2402#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2400#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2398#L25-3 assume !!(main_~d~0#1 < 6); 2396#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2394#L25-3 assume !!(main_~d~0#1 < 6); 2392#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2390#L25-3 assume !!(main_~d~0#1 < 6); 2388#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2386#L25-3 assume !!(main_~d~0#1 < 6); 2384#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2382#L25-3 assume !!(main_~d~0#1 < 6); 2380#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2378#L25-3 assume !!(main_~d~0#1 < 6); 2376#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2375#L25-3 assume !(main_~d~0#1 < 6); 2372#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2370#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2342#L25-3 assume !!(main_~d~0#1 < 6); 2368#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2366#L25-3 assume !!(main_~d~0#1 < 6); 2364#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2362#L25-3 assume !!(main_~d~0#1 < 6); 2360#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2358#L25-3 assume !!(main_~d~0#1 < 6); 2356#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2354#L25-3 assume !!(main_~d~0#1 < 6); 2352#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2350#L25-3 assume !!(main_~d~0#1 < 6); 2348#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2347#L25-3 assume !(main_~d~0#1 < 6); 2344#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2341#L24-3 assume !(main_~c~0#1 < 6); 2142#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 2143#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 2514#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2513#L25-3 assume !!(main_~d~0#1 < 6); 2512#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2511#L25-3 assume !!(main_~d~0#1 < 6); 2509#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2507#L25-3 assume !!(main_~d~0#1 < 6); 2505#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2503#L25-3 assume !!(main_~d~0#1 < 6); 2501#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2499#L25-3 assume !!(main_~d~0#1 < 6); 2497#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2495#L25-3 assume !!(main_~d~0#1 < 6); 2492#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2491#L25-3 assume !(main_~d~0#1 < 6); 2490#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2489#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2487#L25-3 assume !!(main_~d~0#1 < 6); 2485#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2483#L25-3 assume !!(main_~d~0#1 < 6); 2481#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2479#L25-3 assume !!(main_~d~0#1 < 6); 2477#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2475#L25-3 assume !!(main_~d~0#1 < 6); 2473#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2471#L25-3 assume !!(main_~d~0#1 < 6); 2469#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2467#L25-3 assume !!(main_~d~0#1 < 6); 2464#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2463#L25-3 assume !(main_~d~0#1 < 6); 2461#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2459#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2457#L25-3 assume !!(main_~d~0#1 < 6); 2455#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2453#L25-3 assume !!(main_~d~0#1 < 6); 2451#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2449#L25-3 assume !!(main_~d~0#1 < 6); 2447#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2445#L25-3 assume !!(main_~d~0#1 < 6); 2443#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2441#L25-3 assume !!(main_~d~0#1 < 6); 2439#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2437#L25-3 assume !!(main_~d~0#1 < 6); 2434#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2433#L25-3 assume !(main_~d~0#1 < 6); 2431#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2429#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2427#L25-3 assume !!(main_~d~0#1 < 6); 2425#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2423#L25-3 assume !!(main_~d~0#1 < 6); 2421#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2419#L25-3 assume !!(main_~d~0#1 < 6); 2417#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2415#L25-3 assume !!(main_~d~0#1 < 6); 2413#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2411#L25-3 assume !!(main_~d~0#1 < 6); 2409#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2407#L25-3 assume !!(main_~d~0#1 < 6); 2404#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2403#L25-3 assume !(main_~d~0#1 < 6); 2401#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2399#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2397#L25-3 assume !!(main_~d~0#1 < 6); 2395#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2393#L25-3 assume !!(main_~d~0#1 < 6); 2391#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2389#L25-3 assume !!(main_~d~0#1 < 6); 2387#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2385#L25-3 assume !!(main_~d~0#1 < 6); 2383#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2381#L25-3 assume !!(main_~d~0#1 < 6); 2379#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2377#L25-3 assume !!(main_~d~0#1 < 6); 2374#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2373#L25-3 assume !(main_~d~0#1 < 6); 2371#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2369#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2340#L25-3 assume !!(main_~d~0#1 < 6); 2367#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2365#L25-3 assume !!(main_~d~0#1 < 6); 2363#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2361#L25-3 assume !!(main_~d~0#1 < 6); 2359#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2357#L25-3 assume !!(main_~d~0#1 < 6); 2355#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2353#L25-3 assume !!(main_~d~0#1 < 6); 2351#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2349#L25-3 assume !!(main_~d~0#1 < 6); 2346#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2345#L25-3 assume !(main_~d~0#1 < 6); 2343#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2339#L24-3 assume !(main_~c~0#1 < 6); 2338#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 2337#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 2336#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2335#L25-3 assume !!(main_~d~0#1 < 6); 2334#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2333#L25-3 assume !!(main_~d~0#1 < 6); 2332#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2331#L25-3 assume !!(main_~d~0#1 < 6); 2330#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2329#L25-3 assume !!(main_~d~0#1 < 6); 2328#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2327#L25-3 assume !!(main_~d~0#1 < 6); 2326#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2325#L25-3 assume !!(main_~d~0#1 < 6); 2324#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2323#L25-3 assume !(main_~d~0#1 < 6); 2322#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2321#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2320#L25-3 assume !!(main_~d~0#1 < 6); 2319#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2318#L25-3 assume !!(main_~d~0#1 < 6); 2317#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2316#L25-3 assume !!(main_~d~0#1 < 6); 2315#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2314#L25-3 assume !!(main_~d~0#1 < 6); 2313#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2312#L25-3 assume !!(main_~d~0#1 < 6); 2311#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2310#L25-3 assume !!(main_~d~0#1 < 6); 2309#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2308#L25-3 assume !(main_~d~0#1 < 6); 2307#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2306#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2305#L25-3 assume !!(main_~d~0#1 < 6); 2304#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2303#L25-3 assume !!(main_~d~0#1 < 6); 2302#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2301#L25-3 assume !!(main_~d~0#1 < 6); 2300#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2299#L25-3 assume !!(main_~d~0#1 < 6); 2298#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2297#L25-3 assume !!(main_~d~0#1 < 6); 2296#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2295#L25-3 assume !!(main_~d~0#1 < 6); 2294#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2293#L25-3 assume !(main_~d~0#1 < 6); 2292#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2291#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2290#L25-3 assume !!(main_~d~0#1 < 6); 2289#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2288#L25-3 assume !!(main_~d~0#1 < 6); 2287#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2286#L25-3 assume !!(main_~d~0#1 < 6); 2285#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2284#L25-3 assume !!(main_~d~0#1 < 6); 2283#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2282#L25-3 assume !!(main_~d~0#1 < 6); 2281#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2280#L25-3 assume !!(main_~d~0#1 < 6); 2279#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2278#L25-3 assume !(main_~d~0#1 < 6); 2277#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2276#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2275#L25-3 assume !!(main_~d~0#1 < 6); 2274#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2273#L25-3 assume !!(main_~d~0#1 < 6); 2272#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2271#L25-3 assume !!(main_~d~0#1 < 6); 2270#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2269#L25-3 assume !!(main_~d~0#1 < 6); 2268#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2267#L25-3 assume !!(main_~d~0#1 < 6); 2266#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2265#L25-3 assume !!(main_~d~0#1 < 6); 2264#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2263#L25-3 assume !(main_~d~0#1 < 6); 2262#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2261#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2247#L25-3 assume !!(main_~d~0#1 < 6); 2260#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2259#L25-3 assume !!(main_~d~0#1 < 6); 2258#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2257#L25-3 assume !!(main_~d~0#1 < 6); 2256#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2255#L25-3 assume !!(main_~d~0#1 < 6); 2254#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2253#L25-3 assume !!(main_~d~0#1 < 6); 2252#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2251#L25-3 assume !!(main_~d~0#1 < 6); 2250#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2249#L25-3 assume !(main_~d~0#1 < 6); 2248#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2246#L24-3 assume !(main_~c~0#1 < 6); 2245#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 2244#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 2152#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2243#L25-3 assume !!(main_~d~0#1 < 6); 2242#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2241#L25-3 assume !!(main_~d~0#1 < 6); 2240#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2239#L25-3 assume !!(main_~d~0#1 < 6); 2238#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2237#L25-3 assume !!(main_~d~0#1 < 6); 2236#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2235#L25-3 assume !!(main_~d~0#1 < 6); 2234#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2233#L25-3 assume !!(main_~d~0#1 < 6); 2232#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2231#L25-3 assume !(main_~d~0#1 < 6); 2230#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2229#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2228#L25-3 assume !!(main_~d~0#1 < 6); 2227#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2226#L25-3 assume !!(main_~d~0#1 < 6); 2225#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2224#L25-3 assume !!(main_~d~0#1 < 6); 2223#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2222#L25-3 assume !!(main_~d~0#1 < 6); 2221#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2220#L25-3 assume !!(main_~d~0#1 < 6); 2219#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2218#L25-3 assume !!(main_~d~0#1 < 6); 2217#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2216#L25-3 assume !(main_~d~0#1 < 6); 2215#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2214#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2213#L25-3 assume !!(main_~d~0#1 < 6); 2212#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2211#L25-3 assume !!(main_~d~0#1 < 6); 2210#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2209#L25-3 assume !!(main_~d~0#1 < 6); 2208#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2207#L25-3 assume !!(main_~d~0#1 < 6); 2206#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2205#L25-3 assume !!(main_~d~0#1 < 6); 2204#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2203#L25-3 assume !!(main_~d~0#1 < 6); 2202#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2201#L25-3 assume !(main_~d~0#1 < 6); 2200#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2199#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2198#L25-3 assume !!(main_~d~0#1 < 6); 2197#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2196#L25-3 assume !!(main_~d~0#1 < 6); 2195#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2194#L25-3 assume !!(main_~d~0#1 < 6); 2193#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2192#L25-3 assume !!(main_~d~0#1 < 6); 2191#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2190#L25-3 assume !!(main_~d~0#1 < 6); 2189#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2188#L25-3 assume !!(main_~d~0#1 < 6); 2187#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2186#L25-3 assume !(main_~d~0#1 < 6); 2185#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2184#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2183#L25-3 assume !!(main_~d~0#1 < 6); 2182#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2181#L25-3 assume !!(main_~d~0#1 < 6); 2180#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2179#L25-3 assume !!(main_~d~0#1 < 6); 2178#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2177#L25-3 assume !!(main_~d~0#1 < 6); 2176#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2175#L25-3 assume !!(main_~d~0#1 < 6); 2174#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2173#L25-3 assume !!(main_~d~0#1 < 6); 2172#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2171#L25-3 assume !(main_~d~0#1 < 6); 2170#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2169#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 2155#L25-3 assume !!(main_~d~0#1 < 6); 2168#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2167#L25-3 assume !!(main_~d~0#1 < 6); 2166#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2165#L25-3 assume !!(main_~d~0#1 < 6); 2164#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2163#L25-3 assume !!(main_~d~0#1 < 6); 2162#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2161#L25-3 assume !!(main_~d~0#1 < 6); 2160#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2159#L25-3 assume !!(main_~d~0#1 < 6); 2158#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 2157#L25-3 assume !(main_~d~0#1 < 6); 2156#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 2154#L24-3 assume !(main_~c~0#1 < 6); 2153#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 2151#L23-3 assume !(main_~b~0#1 < 6); 2150#L22-2 main_#t~pre7#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre7#1; 2149#L22-3 [2024-10-15 00:43:32,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:32,758 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2024-10-15 00:43:32,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:32,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374239778] [2024-10-15 00:43:32,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:32,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:32,768 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:43:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:32,771 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:43:32,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:32,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1738509047, now seen corresponding path program 5 times [2024-10-15 00:43:32,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:32,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174815146] [2024-10-15 00:43:32,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:32,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:43:33,269 INFO L134 CoverageAnalysis]: Checked inductivity of 24994 backedges. 0 proven. 18886 refuted. 0 times theorem prover too weak. 6108 trivial. 0 not checked. [2024-10-15 00:43:33,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:43:33,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174815146] [2024-10-15 00:43:33,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174815146] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:43:33,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012276656] [2024-10-15 00:43:33,270 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-15 00:43:33,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:43:33,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:33,273 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-10-15 00:43:33,275 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-10-15 00:43:33,537 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 130 check-sat command(s) [2024-10-15 00:43:33,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:43:33,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-15 00:43:33,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:43:34,148 INFO L134 CoverageAnalysis]: Checked inductivity of 24994 backedges. 0 proven. 18886 refuted. 0 times theorem prover too weak. 6108 trivial. 0 not checked. [2024-10-15 00:43:34,149 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:43:34,730 INFO L134 CoverageAnalysis]: Checked inductivity of 24994 backedges. 0 proven. 18886 refuted. 0 times theorem prover too weak. 6108 trivial. 0 not checked. [2024-10-15 00:43:34,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012276656] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:43:34,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:43:34,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2024-10-15 00:43:34,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060339537] [2024-10-15 00:43:34,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:43:34,733 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:43:34,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:43:34,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-15 00:43:34,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-10-15 00:43:34,734 INFO L87 Difference]: Start difference. First operand 377 states and 406 transitions. cyclomatic complexity: 30 Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:43:34,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:43:34,767 INFO L93 Difference]: Finished difference Result 563 states and 606 transitions. [2024-10-15 00:43:34,767 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 563 states and 606 transitions. [2024-10-15 00:43:34,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 561 [2024-10-15 00:43:34,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 563 states to 563 states and 606 transitions. [2024-10-15 00:43:34,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 563 [2024-10-15 00:43:34,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 563 [2024-10-15 00:43:34,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 563 states and 606 transitions. [2024-10-15 00:43:34,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:43:34,779 INFO L218 hiAutomatonCegarLoop]: Abstraction has 563 states and 606 transitions. [2024-10-15 00:43:34,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states and 606 transitions. [2024-10-15 00:43:34,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2024-10-15 00:43:34,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 563 states have (on average 1.0763765541740675) internal successors, (606), 562 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:43:34,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 606 transitions. [2024-10-15 00:43:34,806 INFO L240 hiAutomatonCegarLoop]: Abstraction has 563 states and 606 transitions. [2024-10-15 00:43:34,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 00:43:34,811 INFO L425 stractBuchiCegarLoop]: Abstraction has 563 states and 606 transitions. [2024-10-15 00:43:34,811 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-15 00:43:34,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 563 states and 606 transitions. [2024-10-15 00:43:34,814 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 561 [2024-10-15 00:43:34,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:43:34,814 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:43:34,819 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:43:34,819 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [216, 216, 36, 36, 36, 6, 6, 6, 1, 1, 1] [2024-10-15 00:43:34,820 INFO L745 eck$LassoCheckResult]: Stem: 5340#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 5341#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0; 5344#L22-3 [2024-10-15 00:43:34,821 INFO L747 eck$LassoCheckResult]: Loop: 5344#L22-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 5342#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 5343#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5339#L25-3 assume !!(main_~d~0#1 < 6); 5333#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5334#L25-3 assume !!(main_~d~0#1 < 6); 5891#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5889#L25-3 assume !!(main_~d~0#1 < 6); 5887#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5885#L25-3 assume !!(main_~d~0#1 < 6); 5883#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5881#L25-3 assume !!(main_~d~0#1 < 6); 5879#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5877#L25-3 assume !!(main_~d~0#1 < 6); 5875#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5874#L25-3 assume !(main_~d~0#1 < 6); 5335#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5336#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5869#L25-3 assume !!(main_~d~0#1 < 6); 5867#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5865#L25-3 assume !!(main_~d~0#1 < 6); 5863#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5861#L25-3 assume !!(main_~d~0#1 < 6); 5859#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5857#L25-3 assume !!(main_~d~0#1 < 6); 5855#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5853#L25-3 assume !!(main_~d~0#1 < 6); 5851#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5849#L25-3 assume !!(main_~d~0#1 < 6); 5847#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5846#L25-3 assume !(main_~d~0#1 < 6); 5843#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5841#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5839#L25-3 assume !!(main_~d~0#1 < 6); 5837#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5835#L25-3 assume !!(main_~d~0#1 < 6); 5833#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5831#L25-3 assume !!(main_~d~0#1 < 6); 5829#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5827#L25-3 assume !!(main_~d~0#1 < 6); 5825#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5823#L25-3 assume !!(main_~d~0#1 < 6); 5821#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5819#L25-3 assume !!(main_~d~0#1 < 6); 5817#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5816#L25-3 assume !(main_~d~0#1 < 6); 5813#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5811#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5809#L25-3 assume !!(main_~d~0#1 < 6); 5807#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5805#L25-3 assume !!(main_~d~0#1 < 6); 5803#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5801#L25-3 assume !!(main_~d~0#1 < 6); 5799#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5797#L25-3 assume !!(main_~d~0#1 < 6); 5795#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5793#L25-3 assume !!(main_~d~0#1 < 6); 5791#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5789#L25-3 assume !!(main_~d~0#1 < 6); 5787#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5786#L25-3 assume !(main_~d~0#1 < 6); 5783#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5781#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5779#L25-3 assume !!(main_~d~0#1 < 6); 5777#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5775#L25-3 assume !!(main_~d~0#1 < 6); 5773#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5771#L25-3 assume !!(main_~d~0#1 < 6); 5769#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5767#L25-3 assume !!(main_~d~0#1 < 6); 5765#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5763#L25-3 assume !!(main_~d~0#1 < 6); 5761#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5759#L25-3 assume !!(main_~d~0#1 < 6); 5757#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5756#L25-3 assume !(main_~d~0#1 < 6); 5753#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5751#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5723#L25-3 assume !!(main_~d~0#1 < 6); 5749#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5747#L25-3 assume !!(main_~d~0#1 < 6); 5745#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5743#L25-3 assume !!(main_~d~0#1 < 6); 5741#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5739#L25-3 assume !!(main_~d~0#1 < 6); 5737#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5735#L25-3 assume !!(main_~d~0#1 < 6); 5733#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5731#L25-3 assume !!(main_~d~0#1 < 6); 5729#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5728#L25-3 assume !(main_~d~0#1 < 6); 5725#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5722#L24-3 assume !(main_~c~0#1 < 6); 5337#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 5338#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 5895#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5894#L25-3 assume !!(main_~d~0#1 < 6); 5893#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5892#L25-3 assume !!(main_~d~0#1 < 6); 5890#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5888#L25-3 assume !!(main_~d~0#1 < 6); 5886#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5884#L25-3 assume !!(main_~d~0#1 < 6); 5882#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5880#L25-3 assume !!(main_~d~0#1 < 6); 5878#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5876#L25-3 assume !!(main_~d~0#1 < 6); 5873#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5872#L25-3 assume !(main_~d~0#1 < 6); 5871#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5870#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5868#L25-3 assume !!(main_~d~0#1 < 6); 5866#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5864#L25-3 assume !!(main_~d~0#1 < 6); 5862#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5860#L25-3 assume !!(main_~d~0#1 < 6); 5858#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5856#L25-3 assume !!(main_~d~0#1 < 6); 5854#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5852#L25-3 assume !!(main_~d~0#1 < 6); 5850#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5848#L25-3 assume !!(main_~d~0#1 < 6); 5845#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5844#L25-3 assume !(main_~d~0#1 < 6); 5842#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5840#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5838#L25-3 assume !!(main_~d~0#1 < 6); 5836#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5834#L25-3 assume !!(main_~d~0#1 < 6); 5832#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5830#L25-3 assume !!(main_~d~0#1 < 6); 5828#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5826#L25-3 assume !!(main_~d~0#1 < 6); 5824#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5822#L25-3 assume !!(main_~d~0#1 < 6); 5820#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5818#L25-3 assume !!(main_~d~0#1 < 6); 5815#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5814#L25-3 assume !(main_~d~0#1 < 6); 5812#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5810#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5808#L25-3 assume !!(main_~d~0#1 < 6); 5806#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5804#L25-3 assume !!(main_~d~0#1 < 6); 5802#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5800#L25-3 assume !!(main_~d~0#1 < 6); 5798#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5796#L25-3 assume !!(main_~d~0#1 < 6); 5794#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5792#L25-3 assume !!(main_~d~0#1 < 6); 5790#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5788#L25-3 assume !!(main_~d~0#1 < 6); 5785#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5784#L25-3 assume !(main_~d~0#1 < 6); 5782#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5780#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5778#L25-3 assume !!(main_~d~0#1 < 6); 5776#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5774#L25-3 assume !!(main_~d~0#1 < 6); 5772#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5770#L25-3 assume !!(main_~d~0#1 < 6); 5768#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5766#L25-3 assume !!(main_~d~0#1 < 6); 5764#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5762#L25-3 assume !!(main_~d~0#1 < 6); 5760#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5758#L25-3 assume !!(main_~d~0#1 < 6); 5755#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5754#L25-3 assume !(main_~d~0#1 < 6); 5752#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5750#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5721#L25-3 assume !!(main_~d~0#1 < 6); 5748#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5746#L25-3 assume !!(main_~d~0#1 < 6); 5744#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5742#L25-3 assume !!(main_~d~0#1 < 6); 5740#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5738#L25-3 assume !!(main_~d~0#1 < 6); 5736#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5734#L25-3 assume !!(main_~d~0#1 < 6); 5732#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5730#L25-3 assume !!(main_~d~0#1 < 6); 5727#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5726#L25-3 assume !(main_~d~0#1 < 6); 5724#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5720#L24-3 assume !(main_~c~0#1 < 6); 5719#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 5718#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 5717#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5716#L25-3 assume !!(main_~d~0#1 < 6); 5715#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5714#L25-3 assume !!(main_~d~0#1 < 6); 5713#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5712#L25-3 assume !!(main_~d~0#1 < 6); 5711#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5710#L25-3 assume !!(main_~d~0#1 < 6); 5709#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5708#L25-3 assume !!(main_~d~0#1 < 6); 5707#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5706#L25-3 assume !!(main_~d~0#1 < 6); 5705#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5704#L25-3 assume !(main_~d~0#1 < 6); 5703#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5702#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5701#L25-3 assume !!(main_~d~0#1 < 6); 5700#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5699#L25-3 assume !!(main_~d~0#1 < 6); 5698#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5697#L25-3 assume !!(main_~d~0#1 < 6); 5696#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5695#L25-3 assume !!(main_~d~0#1 < 6); 5694#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5693#L25-3 assume !!(main_~d~0#1 < 6); 5692#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5691#L25-3 assume !!(main_~d~0#1 < 6); 5690#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5689#L25-3 assume !(main_~d~0#1 < 6); 5688#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5687#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5686#L25-3 assume !!(main_~d~0#1 < 6); 5685#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5684#L25-3 assume !!(main_~d~0#1 < 6); 5683#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5682#L25-3 assume !!(main_~d~0#1 < 6); 5681#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5680#L25-3 assume !!(main_~d~0#1 < 6); 5679#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5678#L25-3 assume !!(main_~d~0#1 < 6); 5677#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5676#L25-3 assume !!(main_~d~0#1 < 6); 5675#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5674#L25-3 assume !(main_~d~0#1 < 6); 5673#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5672#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5671#L25-3 assume !!(main_~d~0#1 < 6); 5670#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5669#L25-3 assume !!(main_~d~0#1 < 6); 5668#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5667#L25-3 assume !!(main_~d~0#1 < 6); 5666#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5665#L25-3 assume !!(main_~d~0#1 < 6); 5664#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5663#L25-3 assume !!(main_~d~0#1 < 6); 5662#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5661#L25-3 assume !!(main_~d~0#1 < 6); 5660#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5659#L25-3 assume !(main_~d~0#1 < 6); 5658#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5657#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5656#L25-3 assume !!(main_~d~0#1 < 6); 5655#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5654#L25-3 assume !!(main_~d~0#1 < 6); 5653#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5652#L25-3 assume !!(main_~d~0#1 < 6); 5651#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5650#L25-3 assume !!(main_~d~0#1 < 6); 5649#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5648#L25-3 assume !!(main_~d~0#1 < 6); 5647#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5646#L25-3 assume !!(main_~d~0#1 < 6); 5645#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5644#L25-3 assume !(main_~d~0#1 < 6); 5643#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5642#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5628#L25-3 assume !!(main_~d~0#1 < 6); 5641#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5640#L25-3 assume !!(main_~d~0#1 < 6); 5639#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5638#L25-3 assume !!(main_~d~0#1 < 6); 5637#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5636#L25-3 assume !!(main_~d~0#1 < 6); 5635#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5634#L25-3 assume !!(main_~d~0#1 < 6); 5633#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5632#L25-3 assume !!(main_~d~0#1 < 6); 5631#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5630#L25-3 assume !(main_~d~0#1 < 6); 5629#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5627#L24-3 assume !(main_~c~0#1 < 6); 5626#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 5625#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 5624#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5623#L25-3 assume !!(main_~d~0#1 < 6); 5622#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5621#L25-3 assume !!(main_~d~0#1 < 6); 5620#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5619#L25-3 assume !!(main_~d~0#1 < 6); 5618#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5617#L25-3 assume !!(main_~d~0#1 < 6); 5616#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5615#L25-3 assume !!(main_~d~0#1 < 6); 5614#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5613#L25-3 assume !!(main_~d~0#1 < 6); 5612#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5611#L25-3 assume !(main_~d~0#1 < 6); 5610#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5609#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5608#L25-3 assume !!(main_~d~0#1 < 6); 5607#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5606#L25-3 assume !!(main_~d~0#1 < 6); 5605#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5604#L25-3 assume !!(main_~d~0#1 < 6); 5603#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5602#L25-3 assume !!(main_~d~0#1 < 6); 5601#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5600#L25-3 assume !!(main_~d~0#1 < 6); 5599#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5598#L25-3 assume !!(main_~d~0#1 < 6); 5597#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5596#L25-3 assume !(main_~d~0#1 < 6); 5595#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5594#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5593#L25-3 assume !!(main_~d~0#1 < 6); 5592#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5591#L25-3 assume !!(main_~d~0#1 < 6); 5590#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5589#L25-3 assume !!(main_~d~0#1 < 6); 5588#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5587#L25-3 assume !!(main_~d~0#1 < 6); 5586#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5585#L25-3 assume !!(main_~d~0#1 < 6); 5584#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5583#L25-3 assume !!(main_~d~0#1 < 6); 5582#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5581#L25-3 assume !(main_~d~0#1 < 6); 5580#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5579#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5578#L25-3 assume !!(main_~d~0#1 < 6); 5577#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5576#L25-3 assume !!(main_~d~0#1 < 6); 5575#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5574#L25-3 assume !!(main_~d~0#1 < 6); 5573#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5572#L25-3 assume !!(main_~d~0#1 < 6); 5571#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5570#L25-3 assume !!(main_~d~0#1 < 6); 5569#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5568#L25-3 assume !!(main_~d~0#1 < 6); 5567#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5566#L25-3 assume !(main_~d~0#1 < 6); 5565#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5564#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5563#L25-3 assume !!(main_~d~0#1 < 6); 5562#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5561#L25-3 assume !!(main_~d~0#1 < 6); 5560#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5559#L25-3 assume !!(main_~d~0#1 < 6); 5558#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5557#L25-3 assume !!(main_~d~0#1 < 6); 5556#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5555#L25-3 assume !!(main_~d~0#1 < 6); 5554#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5553#L25-3 assume !!(main_~d~0#1 < 6); 5552#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5551#L25-3 assume !(main_~d~0#1 < 6); 5550#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5549#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5535#L25-3 assume !!(main_~d~0#1 < 6); 5548#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5547#L25-3 assume !!(main_~d~0#1 < 6); 5546#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5545#L25-3 assume !!(main_~d~0#1 < 6); 5544#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5543#L25-3 assume !!(main_~d~0#1 < 6); 5542#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5541#L25-3 assume !!(main_~d~0#1 < 6); 5540#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5539#L25-3 assume !!(main_~d~0#1 < 6); 5538#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5537#L25-3 assume !(main_~d~0#1 < 6); 5536#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5534#L24-3 assume !(main_~c~0#1 < 6); 5533#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 5532#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 5531#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5530#L25-3 assume !!(main_~d~0#1 < 6); 5529#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5528#L25-3 assume !!(main_~d~0#1 < 6); 5527#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5526#L25-3 assume !!(main_~d~0#1 < 6); 5525#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5524#L25-3 assume !!(main_~d~0#1 < 6); 5523#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5522#L25-3 assume !!(main_~d~0#1 < 6); 5521#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5520#L25-3 assume !!(main_~d~0#1 < 6); 5519#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5518#L25-3 assume !(main_~d~0#1 < 6); 5517#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5516#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5515#L25-3 assume !!(main_~d~0#1 < 6); 5514#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5513#L25-3 assume !!(main_~d~0#1 < 6); 5512#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5511#L25-3 assume !!(main_~d~0#1 < 6); 5510#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5509#L25-3 assume !!(main_~d~0#1 < 6); 5508#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5507#L25-3 assume !!(main_~d~0#1 < 6); 5506#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5505#L25-3 assume !!(main_~d~0#1 < 6); 5504#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5503#L25-3 assume !(main_~d~0#1 < 6); 5502#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5501#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5500#L25-3 assume !!(main_~d~0#1 < 6); 5499#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5498#L25-3 assume !!(main_~d~0#1 < 6); 5497#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5496#L25-3 assume !!(main_~d~0#1 < 6); 5495#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5494#L25-3 assume !!(main_~d~0#1 < 6); 5493#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5492#L25-3 assume !!(main_~d~0#1 < 6); 5491#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5490#L25-3 assume !!(main_~d~0#1 < 6); 5489#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5488#L25-3 assume !(main_~d~0#1 < 6); 5487#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5486#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5485#L25-3 assume !!(main_~d~0#1 < 6); 5484#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5483#L25-3 assume !!(main_~d~0#1 < 6); 5482#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5481#L25-3 assume !!(main_~d~0#1 < 6); 5480#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5479#L25-3 assume !!(main_~d~0#1 < 6); 5478#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5477#L25-3 assume !!(main_~d~0#1 < 6); 5476#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5475#L25-3 assume !!(main_~d~0#1 < 6); 5474#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5473#L25-3 assume !(main_~d~0#1 < 6); 5472#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5471#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5470#L25-3 assume !!(main_~d~0#1 < 6); 5469#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5468#L25-3 assume !!(main_~d~0#1 < 6); 5467#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5466#L25-3 assume !!(main_~d~0#1 < 6); 5465#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5464#L25-3 assume !!(main_~d~0#1 < 6); 5463#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5462#L25-3 assume !!(main_~d~0#1 < 6); 5461#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5460#L25-3 assume !!(main_~d~0#1 < 6); 5459#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5458#L25-3 assume !(main_~d~0#1 < 6); 5457#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5456#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5442#L25-3 assume !!(main_~d~0#1 < 6); 5455#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5454#L25-3 assume !!(main_~d~0#1 < 6); 5453#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5452#L25-3 assume !!(main_~d~0#1 < 6); 5451#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5450#L25-3 assume !!(main_~d~0#1 < 6); 5449#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5448#L25-3 assume !!(main_~d~0#1 < 6); 5447#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5446#L25-3 assume !!(main_~d~0#1 < 6); 5445#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5444#L25-3 assume !(main_~d~0#1 < 6); 5443#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5441#L24-3 assume !(main_~c~0#1 < 6); 5440#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 5439#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 5347#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5438#L25-3 assume !!(main_~d~0#1 < 6); 5437#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5436#L25-3 assume !!(main_~d~0#1 < 6); 5435#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5434#L25-3 assume !!(main_~d~0#1 < 6); 5433#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5432#L25-3 assume !!(main_~d~0#1 < 6); 5431#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5430#L25-3 assume !!(main_~d~0#1 < 6); 5429#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5428#L25-3 assume !!(main_~d~0#1 < 6); 5427#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5426#L25-3 assume !(main_~d~0#1 < 6); 5425#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5424#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5423#L25-3 assume !!(main_~d~0#1 < 6); 5422#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5421#L25-3 assume !!(main_~d~0#1 < 6); 5420#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5419#L25-3 assume !!(main_~d~0#1 < 6); 5418#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5417#L25-3 assume !!(main_~d~0#1 < 6); 5416#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5415#L25-3 assume !!(main_~d~0#1 < 6); 5414#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5413#L25-3 assume !!(main_~d~0#1 < 6); 5412#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5411#L25-3 assume !(main_~d~0#1 < 6); 5410#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5409#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5408#L25-3 assume !!(main_~d~0#1 < 6); 5407#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5406#L25-3 assume !!(main_~d~0#1 < 6); 5405#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5404#L25-3 assume !!(main_~d~0#1 < 6); 5403#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5402#L25-3 assume !!(main_~d~0#1 < 6); 5401#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5400#L25-3 assume !!(main_~d~0#1 < 6); 5399#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5398#L25-3 assume !!(main_~d~0#1 < 6); 5397#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5396#L25-3 assume !(main_~d~0#1 < 6); 5395#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5394#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5393#L25-3 assume !!(main_~d~0#1 < 6); 5392#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5391#L25-3 assume !!(main_~d~0#1 < 6); 5390#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5389#L25-3 assume !!(main_~d~0#1 < 6); 5388#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5387#L25-3 assume !!(main_~d~0#1 < 6); 5386#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5385#L25-3 assume !!(main_~d~0#1 < 6); 5384#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5383#L25-3 assume !!(main_~d~0#1 < 6); 5382#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5381#L25-3 assume !(main_~d~0#1 < 6); 5380#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5379#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5378#L25-3 assume !!(main_~d~0#1 < 6); 5377#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5376#L25-3 assume !!(main_~d~0#1 < 6); 5375#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5374#L25-3 assume !!(main_~d~0#1 < 6); 5373#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5372#L25-3 assume !!(main_~d~0#1 < 6); 5371#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5370#L25-3 assume !!(main_~d~0#1 < 6); 5369#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5368#L25-3 assume !!(main_~d~0#1 < 6); 5367#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5366#L25-3 assume !(main_~d~0#1 < 6); 5365#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5364#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 5350#L25-3 assume !!(main_~d~0#1 < 6); 5363#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5362#L25-3 assume !!(main_~d~0#1 < 6); 5361#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5360#L25-3 assume !!(main_~d~0#1 < 6); 5359#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5358#L25-3 assume !!(main_~d~0#1 < 6); 5357#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5356#L25-3 assume !!(main_~d~0#1 < 6); 5355#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5354#L25-3 assume !!(main_~d~0#1 < 6); 5353#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 5352#L25-3 assume !(main_~d~0#1 < 6); 5351#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 5349#L24-3 assume !(main_~c~0#1 < 6); 5348#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 5346#L23-3 assume !(main_~b~0#1 < 6); 5345#L22-2 main_#t~pre7#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre7#1; 5344#L22-3 [2024-10-15 00:43:34,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:34,822 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2024-10-15 00:43:34,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:34,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637062186] [2024-10-15 00:43:34,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:34,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:34,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:34,827 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:43:34,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:34,831 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:43:34,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:34,831 INFO L85 PathProgramCache]: Analyzing trace with hash 247558537, now seen corresponding path program 6 times [2024-10-15 00:43:34,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:34,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774333538] [2024-10-15 00:43:34,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:34,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:34,949 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:43:35,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:35,084 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:43:35,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:35,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1915499015, now seen corresponding path program 1 times [2024-10-15 00:43:35,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:35,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987656341] [2024-10-15 00:43:35,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:35,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:35,195 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:43:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:35,354 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:43:51,220 WARN L286 SmtUtils]: Spent 15.71s on a formula simplification. DAG size of input: 1170 DAG size of output: 870 (called from [L 275] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-10-15 00:43:53,241 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:43:53,242 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:43:53,242 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:43:53,243 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:43:53,243 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:43:53,243 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:53,243 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:43:53,243 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:43:53,243 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration9_Loop [2024-10-15 00:43:53,243 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:43:53,244 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:43:53,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:53,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:53,274 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:53,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:53,280 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:53,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:53,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:53,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:53,354 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:43:53,355 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:43:53,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:53,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:53,359 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:43:53,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-15 00:43:53,363 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:43:53,363 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:43:53,382 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:43:53,382 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~d~0#1=6} Honda state: {ULTIMATE.start_main_~d~0#1=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-15 00:43:53,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-15 00:43:53,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:53,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:53,401 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:43:53,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-15 00:43:53,405 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:43:53,406 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:43:53,422 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:43:53,422 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~b~0#1=6} Honda state: {ULTIMATE.start_main_~b~0#1=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-15 00:43:53,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-15 00:43:53,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:53,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:53,440 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-10-15 00:43:53,442 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-10-15 00:43:53,443 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:43:53,444 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:43:53,460 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:43:53,460 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-10-15 00:43:53,476 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-10-15 00:43:53,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:53,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:53,479 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-10-15 00:43:53,480 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-10-15 00:43:53,482 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:43:53,482 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:43:53,499 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:43:53,499 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre6#1=0} Honda state: {ULTIMATE.start_main_#t~pre6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-15 00:43:53,515 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-10-15 00:43:53,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:53,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:53,518 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-10-15 00:43:53,520 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-10-15 00:43:53,521 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:43:53,521 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:43:53,535 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:43:53,536 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-10-15 00:43:53,553 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-10-15 00:43:53,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:53,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:53,555 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-10-15 00:43:53,557 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-10-15 00:43:53,561 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:43:53,561 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:43:53,576 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:43:53,576 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre7#1=0} Honda state: {ULTIMATE.start_main_#t~pre7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-15 00:43:53,596 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-10-15 00:43:53,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:53,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:53,598 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-10-15 00:43:53,601 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-10-15 00:43:53,603 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:43:53,605 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:43:53,621 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:43:53,622 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-10-15 00:43:53,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-15 00:43:53,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:53,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:53,640 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-10-15 00:43:53,642 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-10-15 00:43:53,643 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:43:53,644 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:43:53,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-15 00:43:53,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:53,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:53,679 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-10-15 00:43:53,683 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-10-15 00:43:53,684 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:43:53,684 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:43:53,723 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-15 00:43:53,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-15 00:43:53,729 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:43:53,729 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:43:53,729 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:43:53,729 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:43:53,729 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:43:53,729 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:53,729 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:43:53,730 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:43:53,730 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration9_Loop [2024-10-15 00:43:53,730 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:43:53,730 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:43:53,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:53,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:53,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:53,740 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:53,743 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:53,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:53,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:53,751 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:53,808 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:43:53,813 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:43:53,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:53,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:53,816 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-10-15 00:43:53,818 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-10-15 00:43:53,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:43:53,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:43:53,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:43:53,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:43:53,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:43:53,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:43:53,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:43:53,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:43:53,838 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:43:53,855 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-10-15 00:43:53,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:53,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:53,859 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-10-15 00:43:53,862 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-10-15 00:43:53,863 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:43:53,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:43:53,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:43:53,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:43:53,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:43:53,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:43:53,878 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:43:53,878 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:43:53,880 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:43:53,896 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-10-15 00:43:53,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:53,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:53,900 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-10-15 00:43:53,902 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-10-15 00:43:53,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:43:53,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:43:53,917 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:43:53,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:43:53,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:43:53,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:43:53,918 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:43:53,918 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:43:53,922 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:43:53,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-10-15 00:43:53,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:53,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:53,941 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-10-15 00:43:53,942 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-10-15 00:43:53,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:43:53,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:43:53,957 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:43:53,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:43:53,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:43:53,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:43:53,958 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:43:53,958 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:43:53,962 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:43:53,978 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-10-15 00:43:53,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:53,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:53,981 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-10-15 00:43:53,982 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-10-15 00:43:53,984 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:43:53,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:43:53,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:43:53,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:43:53,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:43:53,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:43:53,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:43:53,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:43:54,002 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:43:54,017 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-10-15 00:43:54,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:54,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:54,019 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-10-15 00:43:54,019 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-10-15 00:43:54,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:43:54,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:43:54,030 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:43:54,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:43:54,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:43:54,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:43:54,031 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:43:54,031 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:43:54,035 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:43:54,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-10-15 00:43:54,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:54,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:54,050 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-10-15 00:43:54,055 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-10-15 00:43:54,056 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:43:54,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:43:54,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:43:54,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:43:54,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:43:54,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:43:54,067 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:43:54,067 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:43:54,068 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:43:54,079 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-10-15 00:43:54,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:54,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:54,081 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-10-15 00:43:54,082 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-10-15 00:43:54,083 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:43:54,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:43:54,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:43:54,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:43:54,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:43:54,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:43:54,094 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:43:54,094 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:43:54,101 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:43:54,105 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-15 00:43:54,105 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 00:43:54,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:54,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:54,110 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-10-15 00:43:54,112 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-10-15 00:43:54,113 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:43:54,113 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:43:54,114 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:43:54,114 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~a~0#1) = -2*ULTIMATE.start_main_~a~0#1 + 11 Supporting invariants [] [2024-10-15 00:43:54,127 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-10-15 00:43:54,130 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 00:43:54,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:43:54,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:43:54,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:43:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:43:54,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 908 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:43:54,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:43:54,464 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-10-15 00:43:56,889 INFO L134 CoverageAnalysis]: Checked inductivity of 56373 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56373 trivial. 0 not checked. [2024-10-15 00:43:56,895 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-15 00:43:56,897 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 563 states and 606 transitions. cyclomatic complexity: 44 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-10-15 00:43:56,945 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 563 states and 606 transitions. cyclomatic complexity: 44. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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) Result 1124 states and 1211 transitions. Complement of second has 4 states. [2024-10-15 00:43:56,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-15 00:43:56,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-10-15 00:43:56,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-10-15 00:43:56,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 2 letters. Loop has 561 letters. [2024-10-15 00:43:56,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:43:56,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 563 letters. Loop has 561 letters. [2024-10-15 00:43:56,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:43:56,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 2 letters. Loop has 1122 letters. [2024-10-15 00:43:56,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:43:56,964 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1124 states and 1211 transitions. [2024-10-15 00:43:56,973 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 218 [2024-10-15 00:43:56,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1124 states to 1123 states and 1210 transitions. [2024-10-15 00:43:56,979 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 561 [2024-10-15 00:43:56,980 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 562 [2024-10-15 00:43:56,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1123 states and 1210 transitions. [2024-10-15 00:43:56,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:43:56,982 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1123 states and 1210 transitions. [2024-10-15 00:43:56,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states and 1210 transitions. [2024-10-15 00:43:57,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 657. [2024-10-15 00:43:57,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 657 states have (on average 1.0791476407914764) internal successors, (709), 656 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:43:57,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 709 transitions. [2024-10-15 00:43:57,006 INFO L240 hiAutomatonCegarLoop]: Abstraction has 657 states and 709 transitions. [2024-10-15 00:43:57,006 INFO L425 stractBuchiCegarLoop]: Abstraction has 657 states and 709 transitions. [2024-10-15 00:43:57,007 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-15 00:43:57,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 657 states and 709 transitions. [2024-10-15 00:43:57,010 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2024-10-15 00:43:57,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:43:57,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:43:57,013 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-15 00:43:57,013 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [36, 36, 6, 6, 6, 1, 1, 1] [2024-10-15 00:43:57,014 INFO L745 eck$LassoCheckResult]: Stem: 8742#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 8743#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0; 8747#L22-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 8737#L23-3 [2024-10-15 00:43:57,014 INFO L747 eck$LassoCheckResult]: Loop: 8737#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 8744#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 8740#L25-3 assume !!(main_~d~0#1 < 6); 8728#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 8729#L25-3 assume !!(main_~d~0#1 < 6); 9381#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9379#L25-3 assume !!(main_~d~0#1 < 6); 9377#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9375#L25-3 assume !!(main_~d~0#1 < 6); 9373#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9371#L25-3 assume !!(main_~d~0#1 < 6); 9369#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9367#L25-3 assume !!(main_~d~0#1 < 6); 9365#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9364#L25-3 assume !(main_~d~0#1 < 6); 8732#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 8733#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 9384#L25-3 assume !!(main_~d~0#1 < 6); 9383#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9382#L25-3 assume !!(main_~d~0#1 < 6); 9380#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9378#L25-3 assume !!(main_~d~0#1 < 6); 9376#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9374#L25-3 assume !!(main_~d~0#1 < 6); 9372#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9370#L25-3 assume !!(main_~d~0#1 < 6); 9368#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9366#L25-3 assume !!(main_~d~0#1 < 6); 9363#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9362#L25-3 assume !(main_~d~0#1 < 6); 9361#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 9360#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 9359#L25-3 assume !!(main_~d~0#1 < 6); 9358#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9357#L25-3 assume !!(main_~d~0#1 < 6); 9356#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9355#L25-3 assume !!(main_~d~0#1 < 6); 9354#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9353#L25-3 assume !!(main_~d~0#1 < 6); 9352#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9351#L25-3 assume !!(main_~d~0#1 < 6); 9350#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9349#L25-3 assume !!(main_~d~0#1 < 6); 9348#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9347#L25-3 assume !(main_~d~0#1 < 6); 9346#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 9345#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 9344#L25-3 assume !!(main_~d~0#1 < 6); 9343#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9342#L25-3 assume !!(main_~d~0#1 < 6); 9341#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9340#L25-3 assume !!(main_~d~0#1 < 6); 9339#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9338#L25-3 assume !!(main_~d~0#1 < 6); 9337#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9336#L25-3 assume !!(main_~d~0#1 < 6); 9335#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9334#L25-3 assume !!(main_~d~0#1 < 6); 9333#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9332#L25-3 assume !(main_~d~0#1 < 6); 9331#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 9330#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 9329#L25-3 assume !!(main_~d~0#1 < 6); 9328#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9327#L25-3 assume !!(main_~d~0#1 < 6); 9326#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9325#L25-3 assume !!(main_~d~0#1 < 6); 9324#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9323#L25-3 assume !!(main_~d~0#1 < 6); 9322#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9321#L25-3 assume !!(main_~d~0#1 < 6); 9320#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9319#L25-3 assume !!(main_~d~0#1 < 6); 9318#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9317#L25-3 assume !(main_~d~0#1 < 6); 9316#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 9315#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 9301#L25-3 assume !!(main_~d~0#1 < 6); 9314#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9313#L25-3 assume !!(main_~d~0#1 < 6); 9312#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9311#L25-3 assume !!(main_~d~0#1 < 6); 9310#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9309#L25-3 assume !!(main_~d~0#1 < 6); 9308#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9307#L25-3 assume !!(main_~d~0#1 < 6); 9306#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9305#L25-3 assume !!(main_~d~0#1 < 6); 9304#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 9303#L25-3 assume !(main_~d~0#1 < 6); 9302#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 9300#L24-3 assume !(main_~c~0#1 < 6); 8736#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 8737#L23-3 [2024-10-15 00:43:57,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:57,015 INFO L85 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2024-10-15 00:43:57,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:57,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819770224] [2024-10-15 00:43:57,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:57,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:57,022 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:43:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:57,028 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:43:57,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:57,031 INFO L85 PathProgramCache]: Analyzing trace with hash -298958203, now seen corresponding path program 1 times [2024-10-15 00:43:57,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:57,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962829729] [2024-10-15 00:43:57,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:57,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:57,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:57,057 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:43:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:57,078 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:43:57,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:57,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1137457249, now seen corresponding path program 1 times [2024-10-15 00:43:57,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:57,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837739756] [2024-10-15 00:43:57,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:57,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:57,096 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:43:57,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:57,114 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:43:57,943 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:43:57,943 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:43:57,943 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:43:57,944 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:43:57,944 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:43:57,944 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:57,944 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:43:57,944 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:43:57,944 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration10_Loop [2024-10-15 00:43:57,944 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:43:57,944 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:43:57,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:57,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:57,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:57,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:57,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:57,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:58,002 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:43:58,002 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:43:58,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:58,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:58,004 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-10-15 00:43:58,006 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-10-15 00:43:58,007 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:43:58,007 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:43:58,018 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:43:58,018 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre6#1=0} Honda state: {ULTIMATE.start_main_#t~pre6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-15 00:43:58,029 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-10-15 00:43:58,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:58,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:58,030 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-10-15 00:43:58,032 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-10-15 00:43:58,032 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:43:58,032 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:43:58,043 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:43:58,043 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-10-15 00:43:58,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-10-15 00:43:58,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:58,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:58,056 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-10-15 00:43:58,057 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-10-15 00:43:58,058 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:43:58,058 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:43:58,068 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:43:58,069 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-10-15 00:43:58,081 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-10-15 00:43:58,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:58,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:58,082 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-10-15 00:43:58,083 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-10-15 00:43:58,084 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:43:58,084 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:43:58,104 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-10-15 00:43:58,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:58,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:58,106 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-10-15 00:43:58,107 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-10-15 00:43:58,108 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:43:58,108 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:43:58,134 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-15 00:43:58,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-10-15 00:43:58,138 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:43:58,138 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:43:58,138 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:43:58,138 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:43:58,138 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:43:58,138 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:58,138 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:43:58,138 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:43:58,138 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration10_Loop [2024-10-15 00:43:58,139 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:43:58,139 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:43:58,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:58,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:58,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:58,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:58,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:58,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:58,199 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:43:58,199 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:43:58,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:58,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:58,201 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-10-15 00:43:58,204 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-10-15 00:43:58,205 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:43:58,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:43:58,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:43:58,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:43:58,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:43:58,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:43:58,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:43:58,219 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:43:58,221 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:43:58,235 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-10-15 00:43:58,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:58,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:58,238 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-10-15 00:43:58,240 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-10-15 00:43:58,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:43:58,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:43:58,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:43:58,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:43:58,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:43:58,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:43:58,252 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:43:58,253 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:43:58,254 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:43:58,268 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-10-15 00:43:58,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:58,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:58,270 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-10-15 00:43:58,272 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-10-15 00:43:58,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:43:58,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:43:58,284 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:43:58,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:43:58,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:43:58,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:43:58,284 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:43:58,284 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:43:58,286 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:43:58,296 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-10-15 00:43:58,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:58,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:58,297 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-10-15 00:43:58,298 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-10-15 00:43:58,299 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:43:58,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:43:58,309 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:43:58,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:43:58,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:43:58,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:43:58,310 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:43:58,310 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:43:58,311 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:43:58,321 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-10-15 00:43:58,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:58,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:58,324 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-10-15 00:43:58,325 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-10-15 00:43:58,326 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:43:58,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:43:58,338 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:43:58,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:43:58,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:43:58,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:43:58,339 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:43:58,339 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:43:58,341 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:43:58,344 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-15 00:43:58,344 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 00:43:58,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:58,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:58,346 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-10-15 00:43:58,348 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-10-15 00:43:58,348 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:43:58,348 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:43:58,349 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:43:58,349 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~b~0#1) = -2*ULTIMATE.start_main_~b~0#1 + 11 Supporting invariants [] [2024-10-15 00:43:58,375 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-10-15 00:43:58,376 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 00:43:58,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:43:58,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:43:58,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:43:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:43:58,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:43:58,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:43:58,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1527 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1527 trivial. 0 not checked. [2024-10-15 00:43:58,766 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-15 00:43:58,766 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 657 states and 709 transitions. cyclomatic complexity: 54 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-10-15 00:43:58,797 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 657 states and 709 transitions. cyclomatic complexity: 54. 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 1958 states and 2112 transitions. Complement of second has 7 states. [2024-10-15 00:43:58,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-15 00:43:58,799 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-10-15 00:43:58,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-10-15 00:43:58,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 3 letters. Loop has 93 letters. [2024-10-15 00:43:58,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:43:58,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 96 letters. Loop has 93 letters. [2024-10-15 00:43:58,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:43:58,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 3 letters. Loop has 186 letters. [2024-10-15 00:43:58,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:43:58,802 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1958 states and 2112 transitions. [2024-10-15 00:43:58,819 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 118 [2024-10-15 00:43:58,826 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1958 states to 1403 states and 1514 transitions. [2024-10-15 00:43:58,826 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 187 [2024-10-15 00:43:58,827 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 188 [2024-10-15 00:43:58,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1403 states and 1514 transitions. [2024-10-15 00:43:58,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:43:58,827 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1403 states and 1514 transitions. [2024-10-15 00:43:58,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states and 1514 transitions. [2024-10-15 00:43:58,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 766. [2024-10-15 00:43:58,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 766 states have (on average 1.080939947780679) internal successors, (828), 765 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:43:58,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 828 transitions. [2024-10-15 00:43:58,841 INFO L240 hiAutomatonCegarLoop]: Abstraction has 766 states and 828 transitions. [2024-10-15 00:43:58,841 INFO L425 stractBuchiCegarLoop]: Abstraction has 766 states and 828 transitions. [2024-10-15 00:43:58,841 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-15 00:43:58,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 766 states and 828 transitions. [2024-10-15 00:43:58,844 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 108 [2024-10-15 00:43:58,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:43:58,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:43:58,845 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-15 00:43:58,845 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 1, 1, 1] [2024-10-15 00:43:58,845 INFO L745 eck$LassoCheckResult]: Stem: 11669#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 11670#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0; 11675#L22-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 11671#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 11659#L24-3 [2024-10-15 00:43:58,846 INFO L747 eck$LassoCheckResult]: Loop: 11659#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 11666#L25-3 assume !!(main_~d~0#1 < 6); 11654#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 11655#L25-3 assume !!(main_~d~0#1 < 6); 12419#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 12418#L25-3 assume !!(main_~d~0#1 < 6); 12417#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 12416#L25-3 assume !!(main_~d~0#1 < 6); 12415#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 12414#L25-3 assume !!(main_~d~0#1 < 6); 12413#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 12412#L25-3 assume !!(main_~d~0#1 < 6); 12390#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 12389#L25-3 assume !(main_~d~0#1 < 6); 11658#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 11659#L24-3 [2024-10-15 00:43:58,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:58,846 INFO L85 PathProgramCache]: Analyzing trace with hash 925771, now seen corresponding path program 1 times [2024-10-15 00:43:58,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:58,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893943432] [2024-10-15 00:43:58,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:58,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:58,852 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:43:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:58,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:43:58,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:58,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1161196429, now seen corresponding path program 1 times [2024-10-15 00:43:58,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:58,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092177810] [2024-10-15 00:43:58,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:58,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:58,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:58,860 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:43:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:58,863 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:43:58,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:58,863 INFO L85 PathProgramCache]: Analyzing trace with hash -682723837, now seen corresponding path program 1 times [2024-10-15 00:43:58,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:58,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883833463] [2024-10-15 00:43:58,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:58,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:58,868 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:43:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:58,874 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:43:58,936 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:43:58,936 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:43:58,937 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:43:58,937 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:43:58,937 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:43:58,937 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:58,937 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:43:58,937 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:43:58,937 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration11_Loop [2024-10-15 00:43:58,937 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:43:58,937 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:43:58,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:58,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:58,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:58,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:58,978 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:43:58,978 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:43:58,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:58,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:58,980 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-10-15 00:43:58,981 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-10-15 00:43:58,982 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:43:58,982 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:43:59,010 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-10-15 00:43:59,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:59,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:59,012 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-10-15 00:43:59,013 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-10-15 00:43:59,014 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:43:59,014 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:43:59,051 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-15 00:43:59,055 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-10-15 00:43:59,056 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:43:59,056 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:43:59,056 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:43:59,056 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:43:59,056 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:43:59,056 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:59,056 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:43:59,056 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:43:59,056 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration11_Loop [2024-10-15 00:43:59,056 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:43:59,056 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:43:59,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:59,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:59,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:59,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:59,094 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:43:59,094 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:43:59,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:59,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:59,096 INFO L229 MonitoredProcess]: Starting monitored process 38 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-10-15 00:43:59,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-10-15 00:43:59,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:43:59,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:43:59,109 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:43:59,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:43:59,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:43:59,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:43:59,110 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:43:59,110 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:43:59,112 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:43:59,113 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-15 00:43:59,113 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 00:43:59,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:59,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:59,115 INFO L229 MonitoredProcess]: Starting monitored process 39 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-10-15 00:43:59,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-10-15 00:43:59,116 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:43:59,116 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:43:59,116 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:43:59,116 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-10-15 00:43:59,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2024-10-15 00:43:59,127 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 00:43:59,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:43:59,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:43:59,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:43:59,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:43:59,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:43:59,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:43:59,216 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-15 00:43:59,217 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-15 00:43:59,217 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 766 states and 828 transitions. cyclomatic complexity: 66 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:43:59,243 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 766 states and 828 transitions. cyclomatic complexity: 66. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1155 states and 1249 transitions. Complement of second has 7 states. [2024-10-15 00:43:59,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-15 00:43:59,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:43:59,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2024-10-15 00:43:59,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 4 letters. Loop has 15 letters. [2024-10-15 00:43:59,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:43:59,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 19 letters. Loop has 15 letters. [2024-10-15 00:43:59,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:43:59,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 4 letters. Loop has 30 letters. [2024-10-15 00:43:59,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:43:59,247 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1155 states and 1249 transitions. [2024-10-15 00:43:59,254 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 110 [2024-10-15 00:43:59,258 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1155 states to 982 states and 1062 transitions. [2024-10-15 00:43:59,258 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2024-10-15 00:43:59,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2024-10-15 00:43:59,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 982 states and 1062 transitions. [2024-10-15 00:43:59,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:43:59,259 INFO L218 hiAutomatonCegarLoop]: Abstraction has 982 states and 1062 transitions. [2024-10-15 00:43:59,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states and 1062 transitions. [2024-10-15 00:43:59,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 784. [2024-10-15 00:43:59,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 784 states have (on average 1.0829081632653061) internal successors, (849), 783 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:43:59,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 849 transitions. [2024-10-15 00:43:59,271 INFO L240 hiAutomatonCegarLoop]: Abstraction has 784 states and 849 transitions. [2024-10-15 00:43:59,271 INFO L425 stractBuchiCegarLoop]: Abstraction has 784 states and 849 transitions. [2024-10-15 00:43:59,272 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-15 00:43:59,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 784 states and 849 transitions. [2024-10-15 00:43:59,275 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 110 [2024-10-15 00:43:59,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:43:59,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:43:59,275 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-15 00:43:59,275 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:43:59,275 INFO L745 eck$LassoCheckResult]: Stem: 13668#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 13669#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0; 13670#L22-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 13671#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 13675#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 13656#L25-3 [2024-10-15 00:43:59,275 INFO L747 eck$LassoCheckResult]: Loop: 13656#L25-3 assume !!(main_~d~0#1 < 6); 13655#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 13656#L25-3 [2024-10-15 00:43:59,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:59,276 INFO L85 PathProgramCache]: Analyzing trace with hash 28698927, now seen corresponding path program 1 times [2024-10-15 00:43:59,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:59,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653076298] [2024-10-15 00:43:59,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:59,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:59,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:59,282 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:43:59,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:59,284 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:43:59,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:59,285 INFO L85 PathProgramCache]: Analyzing trace with hash 2051, now seen corresponding path program 1 times [2024-10-15 00:43:59,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:59,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541740139] [2024-10-15 00:43:59,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:59,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:59,287 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:43:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:59,288 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:43:59,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:59,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1809866161, now seen corresponding path program 1 times [2024-10-15 00:43:59,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:59,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858513260] [2024-10-15 00:43:59,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:59,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:59,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:59,292 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:43:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:59,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:43:59,309 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:43:59,309 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:43:59,309 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:43:59,309 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:43:59,309 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:43:59,309 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:59,309 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:43:59,309 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:43:59,310 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration12_Loop [2024-10-15 00:43:59,310 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:43:59,310 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:43:59,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:59,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:59,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-10-15 00:43:59,364 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:43:59,368 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:43:59,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:59,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:59,372 INFO L229 MonitoredProcess]: Starting monitored process 40 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-10-15 00:43:59,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-10-15 00:43:59,376 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-10-15 00:43:59,376 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:43:59,377 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:43:59,390 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:43:59,390 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-10-15 00:43:59,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-10-15 00:43:59,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:59,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:59,408 INFO L229 MonitoredProcess]: Starting monitored process 41 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-10-15 00:43:59,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-10-15 00:43:59,410 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:43:59,410 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:43:59,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2024-10-15 00:43:59,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:59,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:59,440 INFO L229 MonitoredProcess]: Starting monitored process 42 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-10-15 00:43:59,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-10-15 00:43:59,442 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:43:59,442 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:43:59,468 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-15 00:43:59,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-10-15 00:43:59,472 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:43:59,472 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:43:59,472 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:43:59,472 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:43:59,472 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:43:59,472 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:59,472 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:43:59,473 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:43:59,473 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration12_Loop [2024-10-15 00:43:59,473 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:43:59,473 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:43:59,473 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:59,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:59,490 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:43:59,491 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:43:59,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:59,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:59,492 INFO L229 MonitoredProcess]: Starting monitored process 43 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-10-15 00:43:59,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-10-15 00:43:59,494 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:43:59,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:43:59,504 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:43:59,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:43:59,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:43:59,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:43:59,504 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:43:59,505 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:43:59,506 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:43:59,508 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-15 00:43:59,508 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 00:43:59,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:59,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:59,510 INFO L229 MonitoredProcess]: Starting monitored process 44 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-10-15 00:43:59,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-10-15 00:43:59,511 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:43:59,511 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:43:59,511 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:43:59,512 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~d~0#1) = -2*ULTIMATE.start_main_~d~0#1 + 11 Supporting invariants [] [2024-10-15 00:43:59,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-10-15 00:43:59,523 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 00:43:59,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:59,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:43:59,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:43:59,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:43:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:43:59,554 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:43:59,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:43:59,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:43:59,564 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-15 00:43:59,565 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 784 states and 849 transitions. cyclomatic complexity: 71 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:43:59,589 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 784 states and 849 transitions. cyclomatic complexity: 71. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 860 states and 933 transitions. Complement of second has 7 states. [2024-10-15 00:43:59,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-15 00:43:59,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:43:59,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-15 00:43:59,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 2 letters. [2024-10-15 00:43:59,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:43:59,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 2 letters. [2024-10-15 00:43:59,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:43:59,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 4 letters. [2024-10-15 00:43:59,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:43:59,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 860 states and 933 transitions. [2024-10-15 00:43:59,596 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 110 [2024-10-15 00:43:59,599 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 860 states to 832 states and 900 transitions. [2024-10-15 00:43:59,599 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2024-10-15 00:43:59,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2024-10-15 00:43:59,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 832 states and 900 transitions. [2024-10-15 00:43:59,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:43:59,600 INFO L218 hiAutomatonCegarLoop]: Abstraction has 832 states and 900 transitions. [2024-10-15 00:43:59,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states and 900 transitions. [2024-10-15 00:43:59,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 784. [2024-10-15 00:43:59,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 784 states have (on average 1.0816326530612246) internal successors, (848), 783 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:43:59,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 848 transitions. [2024-10-15 00:43:59,612 INFO L240 hiAutomatonCegarLoop]: Abstraction has 784 states and 848 transitions. [2024-10-15 00:43:59,612 INFO L425 stractBuchiCegarLoop]: Abstraction has 784 states and 848 transitions. [2024-10-15 00:43:59,612 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-10-15 00:43:59,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 784 states and 848 transitions. [2024-10-15 00:43:59,615 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 110 [2024-10-15 00:43:59,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:43:59,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:43:59,616 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 2, 1, 1, 1, 1, 1, 1] [2024-10-15 00:43:59,616 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:43:59,616 INFO L745 eck$LassoCheckResult]: Stem: 15356#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 15357#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0; 15358#L22-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 15359#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 15363#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 15365#L25-3 assume !!(main_~d~0#1 < 6); 16126#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 16125#L25-3 assume !!(main_~d~0#1 < 6); 16123#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 16121#L25-3 assume !!(main_~d~0#1 < 6); 16119#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 16117#L25-3 assume !!(main_~d~0#1 < 6); 16115#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 16113#L25-3 assume !!(main_~d~0#1 < 6); 16111#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 16109#L25-3 assume !!(main_~d~0#1 < 6); 16106#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 16105#L25-3 assume !(main_~d~0#1 < 6); 15954#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 15733#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 15344#L25-3 [2024-10-15 00:43:59,616 INFO L747 eck$LassoCheckResult]: Loop: 15344#L25-3 assume !!(main_~d~0#1 < 6); 15343#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 15344#L25-3 [2024-10-15 00:43:59,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:59,617 INFO L85 PathProgramCache]: Analyzing trace with hash 310397559, now seen corresponding path program 2 times [2024-10-15 00:43:59,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:59,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414539584] [2024-10-15 00:43:59,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:59,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:59,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:59,622 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:43:59,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:59,626 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:43:59,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:59,627 INFO L85 PathProgramCache]: Analyzing trace with hash 2051, now seen corresponding path program 2 times [2024-10-15 00:43:59,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:59,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278063927] [2024-10-15 00:43:59,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:59,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:59,631 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:43:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:59,632 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:43:59,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:59,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1939311865, now seen corresponding path program 3 times [2024-10-15 00:43:59,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:59,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987655013] [2024-10-15 00:43:59,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:59,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:59,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:59,637 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:43:59,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:59,643 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:43:59,655 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:43:59,655 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:43:59,655 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:43:59,655 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:43:59,655 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:43:59,655 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:59,655 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:43:59,656 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:43:59,656 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration13_Loop [2024-10-15 00:43:59,656 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:43:59,656 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:43:59,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:59,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:59,678 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:43:59,678 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:43:59,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:59,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:59,681 INFO L229 MonitoredProcess]: Starting monitored process 45 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-10-15 00:43:59,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-10-15 00:43:59,683 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:43:59,683 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:43:59,698 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:43:59,699 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-10-15 00:43:59,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-10-15 00:43:59,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:59,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:59,717 INFO L229 MonitoredProcess]: Starting monitored process 46 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-10-15 00:43:59,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-10-15 00:43:59,719 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:43:59,719 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:43:59,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2024-10-15 00:43:59,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:59,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:59,750 INFO L229 MonitoredProcess]: Starting monitored process 47 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-10-15 00:43:59,753 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:43:59,753 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:43:59,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-10-15 00:43:59,786 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-15 00:43:59,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2024-10-15 00:43:59,792 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:43:59,792 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:43:59,793 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:43:59,793 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:43:59,793 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:43:59,793 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:59,793 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:43:59,793 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:43:59,793 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration13_Loop [2024-10-15 00:43:59,793 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:43:59,793 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:43:59,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:59,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:59,817 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:43:59,817 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:43:59,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:59,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:59,819 INFO L229 MonitoredProcess]: Starting monitored process 48 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-10-15 00:43:59,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-10-15 00:43:59,822 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:43:59,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:43:59,834 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:43:59,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:43:59,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:43:59,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:43:59,835 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:43:59,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:43:59,837 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:43:59,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2024-10-15 00:43:59,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:59,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:59,850 INFO L229 MonitoredProcess]: Starting monitored process 49 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-10-15 00:43:59,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-10-15 00:43:59,851 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:43:59,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:43:59,861 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:43:59,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:43:59,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:43:59,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:43:59,862 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:43:59,862 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:43:59,864 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:43:59,866 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-15 00:43:59,866 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 00:43:59,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:59,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:59,867 INFO L229 MonitoredProcess]: Starting monitored process 50 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-10-15 00:43:59,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-10-15 00:43:59,868 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:43:59,869 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:43:59,869 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:43:59,869 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~d~0#1) = -2*ULTIMATE.start_main_~d~0#1 + 11 Supporting invariants [] [2024-10-15 00:43:59,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-10-15 00:43:59,880 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 00:43:59,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:59,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:43:59,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:43:59,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:43:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:43:59,933 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:43:59,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:43:59,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:43:59,947 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-15 00:43:59,947 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 784 states and 848 transitions. cyclomatic complexity: 70 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:43:59,970 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 784 states and 848 transitions. cyclomatic complexity: 70. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 856 states and 927 transitions. Complement of second has 7 states. [2024-10-15 00:43:59,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-15 00:43:59,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:43:59,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-15 00:43:59,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 20 letters. Loop has 2 letters. [2024-10-15 00:43:59,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:43:59,973 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:43:59,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:43:59,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:43:59,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:44:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:44:00,029 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:44:00,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:44:00,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:44:00,042 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-15 00:44:00,042 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 784 states and 848 transitions. cyclomatic complexity: 70 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:44:00,061 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 784 states and 848 transitions. cyclomatic complexity: 70. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 856 states and 927 transitions. Complement of second has 7 states. [2024-10-15 00:44:00,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-15 00:44:00,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:44:00,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-15 00:44:00,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 20 letters. Loop has 2 letters. [2024-10-15 00:44:00,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:44:00,063 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:44:00,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:44:00,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:44:00,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:44:00,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:44:00,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:44:00,111 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:44:00,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:44:00,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:44:00,123 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-15 00:44:00,123 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 784 states and 848 transitions. cyclomatic complexity: 70 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:44:00,145 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 784 states and 848 transitions. cyclomatic complexity: 70. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1218 states and 1335 transitions. Complement of second has 6 states. [2024-10-15 00:44:00,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-15 00:44:00,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:44:00,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2024-10-15 00:44:00,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 20 letters. Loop has 2 letters. [2024-10-15 00:44:00,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:44:00,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 22 letters. Loop has 2 letters. [2024-10-15 00:44:00,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:44:00,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 20 letters. Loop has 4 letters. [2024-10-15 00:44:00,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:44:00,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1218 states and 1335 transitions. [2024-10-15 00:44:00,156 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 108 [2024-10-15 00:44:00,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1218 states to 769 states and 830 transitions. [2024-10-15 00:44:00,160 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-10-15 00:44:00,160 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-10-15 00:44:00,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 769 states and 830 transitions. [2024-10-15 00:44:00,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:44:00,161 INFO L218 hiAutomatonCegarLoop]: Abstraction has 769 states and 830 transitions. [2024-10-15 00:44:00,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states and 830 transitions. [2024-10-15 00:44:00,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 766. [2024-10-15 00:44:00,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 766 states have (on average 1.0796344647519582) internal successors, (827), 765 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:44:00,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 827 transitions. [2024-10-15 00:44:00,171 INFO L240 hiAutomatonCegarLoop]: Abstraction has 766 states and 827 transitions. [2024-10-15 00:44:00,171 INFO L425 stractBuchiCegarLoop]: Abstraction has 766 states and 827 transitions. [2024-10-15 00:44:00,172 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-10-15 00:44:00,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 766 states and 827 transitions. [2024-10-15 00:44:00,174 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 108 [2024-10-15 00:44:00,174 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:44:00,174 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:44:00,177 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [36, 36, 6, 6, 6, 2, 1, 1, 1, 1, 1] [2024-10-15 00:44:00,177 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 1, 1, 1] [2024-10-15 00:44:00,177 INFO L745 eck$LassoCheckResult]: Stem: 19306#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 19307#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0; 19312#L22-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 19308#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 19309#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 19689#L25-3 assume !!(main_~d~0#1 < 6); 19687#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19685#L25-3 assume !!(main_~d~0#1 < 6); 19683#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19681#L25-3 assume !!(main_~d~0#1 < 6); 19679#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19677#L25-3 assume !!(main_~d~0#1 < 6); 19676#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19673#L25-3 assume !!(main_~d~0#1 < 6); 19671#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19669#L25-3 assume !!(main_~d~0#1 < 6); 19666#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19665#L25-3 assume !(main_~d~0#1 < 6); 19663#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 19661#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 19659#L25-3 assume !!(main_~d~0#1 < 6); 19657#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19655#L25-3 assume !!(main_~d~0#1 < 6); 19653#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19651#L25-3 assume !!(main_~d~0#1 < 6); 19649#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19647#L25-3 assume !!(main_~d~0#1 < 6); 19646#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19643#L25-3 assume !!(main_~d~0#1 < 6); 19641#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19639#L25-3 assume !!(main_~d~0#1 < 6); 19636#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19635#L25-3 assume !(main_~d~0#1 < 6); 19633#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 19631#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 19629#L25-3 assume !!(main_~d~0#1 < 6); 19627#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19625#L25-3 assume !!(main_~d~0#1 < 6); 19623#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19621#L25-3 assume !!(main_~d~0#1 < 6); 19619#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19617#L25-3 assume !!(main_~d~0#1 < 6); 19616#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19613#L25-3 assume !!(main_~d~0#1 < 6); 19611#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19609#L25-3 assume !!(main_~d~0#1 < 6); 19606#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19605#L25-3 assume !(main_~d~0#1 < 6); 19603#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 19601#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 19599#L25-3 assume !!(main_~d~0#1 < 6); 19597#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19595#L25-3 assume !!(main_~d~0#1 < 6); 19593#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19591#L25-3 assume !!(main_~d~0#1 < 6); 19589#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19587#L25-3 assume !!(main_~d~0#1 < 6); 19586#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19583#L25-3 assume !!(main_~d~0#1 < 6); 19581#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19579#L25-3 assume !!(main_~d~0#1 < 6); 19576#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19575#L25-3 assume !(main_~d~0#1 < 6); 19573#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 19571#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 19569#L25-3 assume !!(main_~d~0#1 < 6); 19567#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19565#L25-3 assume !!(main_~d~0#1 < 6); 19563#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19561#L25-3 assume !!(main_~d~0#1 < 6); 19559#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19557#L25-3 assume !!(main_~d~0#1 < 6); 19556#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19553#L25-3 assume !!(main_~d~0#1 < 6); 19551#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19549#L25-3 assume !!(main_~d~0#1 < 6); 19547#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19546#L25-3 assume !(main_~d~0#1 < 6); 19544#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 19542#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 19504#L25-3 assume !!(main_~d~0#1 < 6); 19539#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19537#L25-3 assume !!(main_~d~0#1 < 6); 19535#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19533#L25-3 assume !!(main_~d~0#1 < 6); 19531#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19528#L25-3 assume !!(main_~d~0#1 < 6); 19526#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19522#L25-3 assume !!(main_~d~0#1 < 6); 19519#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19515#L25-3 assume !!(main_~d~0#1 < 6); 19510#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19509#L25-3 assume !(main_~d~0#1 < 6); 19507#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 19503#L24-3 assume !(main_~c~0#1 < 6); 19501#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 19497#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 19296#L24-3 [2024-10-15 00:44:00,177 INFO L747 eck$LassoCheckResult]: Loop: 19296#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 19303#L25-3 assume !!(main_~d~0#1 < 6); 19304#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19530#L25-3 assume !!(main_~d~0#1 < 6); 19527#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19525#L25-3 assume !!(main_~d~0#1 < 6); 19521#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19518#L25-3 assume !!(main_~d~0#1 < 6); 19514#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19512#L25-3 assume !!(main_~d~0#1 < 6); 19508#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19506#L25-3 assume !!(main_~d~0#1 < 6); 19500#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 19499#L25-3 assume !(main_~d~0#1 < 6); 19295#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 19296#L24-3 [2024-10-15 00:44:00,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:44:00,178 INFO L85 PathProgramCache]: Analyzing trace with hash -901436333, now seen corresponding path program 2 times [2024-10-15 00:44:00,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:44:00,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634918325] [2024-10-15 00:44:00,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:44:00,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:44:00,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:44:00,194 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:44:00,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:44:00,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:44:00,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:44:00,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1161196429, now seen corresponding path program 2 times [2024-10-15 00:44:00,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:44:00,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826794754] [2024-10-15 00:44:00,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:44:00,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:44:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:44:00,210 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:44:00,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:44:00,212 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:44:00,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:44:00,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1529665787, now seen corresponding path program 3 times [2024-10-15 00:44:00,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:44:00,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788885924] [2024-10-15 00:44:00,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:44:00,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:44:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:44:00,225 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:44:00,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:44:00,238 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:44:00,296 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:44:00,297 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:44:00,297 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:44:00,297 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:44:00,297 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:44:00,297 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:44:00,297 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:44:00,297 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:44:00,297 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration14_Loop [2024-10-15 00:44:00,297 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:44:00,297 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:44:00,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:44:00,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:44:00,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:44:00,305 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:44:00,334 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:44:00,334 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:44:00,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:44:00,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:44:00,336 INFO L229 MonitoredProcess]: Starting monitored process 51 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-10-15 00:44:00,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-10-15 00:44:00,338 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:44:00,339 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:44:00,355 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:44:00,355 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-10-15 00:44:00,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2024-10-15 00:44:00,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:44:00,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:44:00,372 INFO L229 MonitoredProcess]: Starting monitored process 52 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-10-15 00:44:00,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-10-15 00:44:00,374 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:44:00,374 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:44:00,391 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:44:00,391 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~d~0#1=6} Honda state: {ULTIMATE.start_main_~d~0#1=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-15 00:44:00,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2024-10-15 00:44:00,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:44:00,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:44:00,407 INFO L229 MonitoredProcess]: Starting monitored process 53 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-10-15 00:44:00,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-10-15 00:44:00,410 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:44:00,410 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:44:00,425 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:44:00,425 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-10-15 00:44:00,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2024-10-15 00:44:00,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:44:00,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:44:00,441 INFO L229 MonitoredProcess]: Starting monitored process 54 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-10-15 00:44:00,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-10-15 00:44:00,443 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:44:00,443 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:44:00,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2024-10-15 00:44:00,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:44:00,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:44:00,473 INFO L229 MonitoredProcess]: Starting monitored process 55 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-10-15 00:44:00,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-10-15 00:44:00,475 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:44:00,475 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:44:00,508 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-15 00:44:00,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2024-10-15 00:44:00,513 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:44:00,514 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:44:00,514 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:44:00,514 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:44:00,514 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:44:00,514 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:44:00,514 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:44:00,514 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:44:00,514 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration14_Loop [2024-10-15 00:44:00,514 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:44:00,514 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:44:00,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:44:00,518 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:44:00,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:44:00,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:44:00,554 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:44:00,555 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:44:00,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:44:00,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:44:00,558 INFO L229 MonitoredProcess]: Starting monitored process 56 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-10-15 00:44:00,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-10-15 00:44:00,560 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:44:00,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:44:00,572 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:44:00,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:44:00,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:44:00,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:44:00,573 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:44:00,573 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:44:00,577 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:44:00,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2024-10-15 00:44:00,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:44:00,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:44:00,592 INFO L229 MonitoredProcess]: Starting monitored process 57 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-10-15 00:44:00,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-10-15 00:44:00,594 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:44:00,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:44:00,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:44:00,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:44:00,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:44:00,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:44:00,604 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:44:00,604 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:44:00,605 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:44:00,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2024-10-15 00:44:00,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:44:00,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:44:00,617 INFO L229 MonitoredProcess]: Starting monitored process 58 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-10-15 00:44:00,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-10-15 00:44:00,619 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:44:00,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:44:00,629 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:44:00,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:44:00,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:44:00,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:44:00,630 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:44:00,630 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:44:00,632 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:44:00,634 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-15 00:44:00,634 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 00:44:00,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:44:00,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:44:00,637 INFO L229 MonitoredProcess]: Starting monitored process 59 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-10-15 00:44:00,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-10-15 00:44:00,638 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:44:00,638 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:44:00,639 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:44:00,639 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-10-15 00:44:00,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2024-10-15 00:44:00,650 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 00:44:00,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:44:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:44:00,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:44:00,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:44:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:44:00,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:44:00,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:44:00,863 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-15 00:44:00,864 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-15 00:44:00,864 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 766 states and 827 transitions. cyclomatic complexity: 65 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:44:00,884 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 766 states and 827 transitions. cyclomatic complexity: 65. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 1125 states and 1215 transitions. Complement of second has 7 states. [2024-10-15 00:44:00,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-15 00:44:00,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:44:00,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2024-10-15 00:44:00,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 97 letters. Loop has 15 letters. [2024-10-15 00:44:00,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:44:00,885 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:44:00,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:44:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:44:00,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:44:00,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:44:01,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:44:01,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:44:01,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:44:01,098 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-15 00:44:01,098 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-15 00:44:01,098 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 766 states and 827 transitions. cyclomatic complexity: 65 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:44:01,116 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 766 states and 827 transitions. cyclomatic complexity: 65. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 1125 states and 1215 transitions. Complement of second has 7 states. [2024-10-15 00:44:01,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-15 00:44:01,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:44:01,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2024-10-15 00:44:01,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 97 letters. Loop has 15 letters. [2024-10-15 00:44:01,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:44:01,117 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:44:01,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:44:01,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:44:01,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:44:01,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:44:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:44:01,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:44:01,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:44:01,321 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-15 00:44:01,321 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-15 00:44:01,321 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 766 states and 827 transitions. cyclomatic complexity: 65 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:44:01,340 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 766 states and 827 transitions. cyclomatic complexity: 65. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 1474 states and 1593 transitions. Complement of second has 6 states. [2024-10-15 00:44:01,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-15 00:44:01,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:44:01,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2024-10-15 00:44:01,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 97 letters. Loop has 15 letters. [2024-10-15 00:44:01,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:44:01,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 112 letters. Loop has 15 letters. [2024-10-15 00:44:01,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:44:01,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 97 letters. Loop has 30 letters. [2024-10-15 00:44:01,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:44:01,344 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1474 states and 1593 transitions. [2024-10-15 00:44:01,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2024-10-15 00:44:01,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-10-15 00:44:01,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1474 states to 658 states and 709 transitions. [2024-10-15 00:44:01,383 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-10-15 00:44:01,383 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-10-15 00:44:01,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 658 states and 709 transitions. [2024-10-15 00:44:01,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:44:01,383 INFO L218 hiAutomatonCegarLoop]: Abstraction has 658 states and 709 transitions. [2024-10-15 00:44:01,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states and 709 transitions. [2024-10-15 00:44:01,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 657. [2024-10-15 00:44:01,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 657 states have (on average 1.0776255707762556) internal successors, (708), 656 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:44:01,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 708 transitions. [2024-10-15 00:44:01,401 INFO L240 hiAutomatonCegarLoop]: Abstraction has 657 states and 708 transitions. [2024-10-15 00:44:01,401 INFO L425 stractBuchiCegarLoop]: Abstraction has 657 states and 708 transitions. [2024-10-15 00:44:01,401 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-10-15 00:44:01,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 657 states and 708 transitions. [2024-10-15 00:44:01,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2024-10-15 00:44:01,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:44:01,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:44:01,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2024-10-15 00:44:01,417 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [216, 216, 36, 36, 36, 6, 6, 6, 2, 1, 1, 1, 1] [2024-10-15 00:44:01,417 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [36, 36, 6, 6, 6, 1, 1, 1] [2024-10-15 00:44:01,417 INFO L745 eck$LassoCheckResult]: Stem: 24838#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 24839#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~d~0#1 := 6;main_~a~0#1 := 0; 24843#L22-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 24841#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 24842#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25475#L25-3 assume !!(main_~d~0#1 < 6); 25474#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25473#L25-3 assume !!(main_~d~0#1 < 6); 25472#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25471#L25-3 assume !!(main_~d~0#1 < 6); 25470#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25469#L25-3 assume !!(main_~d~0#1 < 6); 25468#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25467#L25-3 assume !!(main_~d~0#1 < 6); 25466#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25465#L25-3 assume !!(main_~d~0#1 < 6); 25464#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25463#L25-3 assume !(main_~d~0#1 < 6); 25462#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25461#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25459#L25-3 assume !!(main_~d~0#1 < 6); 25457#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25455#L25-3 assume !!(main_~d~0#1 < 6); 25453#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25451#L25-3 assume !!(main_~d~0#1 < 6); 25449#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25447#L25-3 assume !!(main_~d~0#1 < 6); 25445#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25443#L25-3 assume !!(main_~d~0#1 < 6); 25441#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25439#L25-3 assume !!(main_~d~0#1 < 6); 25436#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25435#L25-3 assume !(main_~d~0#1 < 6); 25433#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25431#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25429#L25-3 assume !!(main_~d~0#1 < 6); 25427#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25425#L25-3 assume !!(main_~d~0#1 < 6); 25423#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25421#L25-3 assume !!(main_~d~0#1 < 6); 25419#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25417#L25-3 assume !!(main_~d~0#1 < 6); 25415#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25413#L25-3 assume !!(main_~d~0#1 < 6); 25411#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25409#L25-3 assume !!(main_~d~0#1 < 6); 25406#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25405#L25-3 assume !(main_~d~0#1 < 6); 25403#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25401#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25399#L25-3 assume !!(main_~d~0#1 < 6); 25397#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25395#L25-3 assume !!(main_~d~0#1 < 6); 25393#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25391#L25-3 assume !!(main_~d~0#1 < 6); 25389#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25387#L25-3 assume !!(main_~d~0#1 < 6); 25385#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25383#L25-3 assume !!(main_~d~0#1 < 6); 25381#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25379#L25-3 assume !!(main_~d~0#1 < 6); 25376#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25375#L25-3 assume !(main_~d~0#1 < 6); 25373#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25371#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25369#L25-3 assume !!(main_~d~0#1 < 6); 25367#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25365#L25-3 assume !!(main_~d~0#1 < 6); 25363#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25361#L25-3 assume !!(main_~d~0#1 < 6); 25359#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25357#L25-3 assume !!(main_~d~0#1 < 6); 25355#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25353#L25-3 assume !!(main_~d~0#1 < 6); 25351#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25349#L25-3 assume !!(main_~d~0#1 < 6); 25346#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25345#L25-3 assume !(main_~d~0#1 < 6); 25343#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25341#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25312#L25-3 assume !!(main_~d~0#1 < 6); 25339#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25337#L25-3 assume !!(main_~d~0#1 < 6); 25335#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25333#L25-3 assume !!(main_~d~0#1 < 6); 25331#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25329#L25-3 assume !!(main_~d~0#1 < 6); 25327#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25325#L25-3 assume !!(main_~d~0#1 < 6); 25323#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25321#L25-3 assume !!(main_~d~0#1 < 6); 25318#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25317#L25-3 assume !(main_~d~0#1 < 6); 25315#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25311#L24-3 assume !(main_~c~0#1 < 6); 24835#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 24836#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 24846#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 24837#L25-3 assume !!(main_~d~0#1 < 6); 24829#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24830#L25-3 assume !!(main_~d~0#1 < 6); 25485#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25484#L25-3 assume !!(main_~d~0#1 < 6); 25483#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25482#L25-3 assume !!(main_~d~0#1 < 6); 25481#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25480#L25-3 assume !!(main_~d~0#1 < 6); 25479#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25478#L25-3 assume !!(main_~d~0#1 < 6); 25477#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25476#L25-3 assume !(main_~d~0#1 < 6); 24831#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 24832#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25460#L25-3 assume !!(main_~d~0#1 < 6); 25458#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25456#L25-3 assume !!(main_~d~0#1 < 6); 25454#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25452#L25-3 assume !!(main_~d~0#1 < 6); 25450#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25448#L25-3 assume !!(main_~d~0#1 < 6); 25446#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25444#L25-3 assume !!(main_~d~0#1 < 6); 25442#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25440#L25-3 assume !!(main_~d~0#1 < 6); 25438#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25437#L25-3 assume !(main_~d~0#1 < 6); 25434#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25432#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25430#L25-3 assume !!(main_~d~0#1 < 6); 25428#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25426#L25-3 assume !!(main_~d~0#1 < 6); 25424#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25422#L25-3 assume !!(main_~d~0#1 < 6); 25420#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25418#L25-3 assume !!(main_~d~0#1 < 6); 25416#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25414#L25-3 assume !!(main_~d~0#1 < 6); 25412#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25410#L25-3 assume !!(main_~d~0#1 < 6); 25408#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25407#L25-3 assume !(main_~d~0#1 < 6); 25404#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25402#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25400#L25-3 assume !!(main_~d~0#1 < 6); 25398#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25396#L25-3 assume !!(main_~d~0#1 < 6); 25394#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25392#L25-3 assume !!(main_~d~0#1 < 6); 25390#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25388#L25-3 assume !!(main_~d~0#1 < 6); 25386#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25384#L25-3 assume !!(main_~d~0#1 < 6); 25382#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25380#L25-3 assume !!(main_~d~0#1 < 6); 25378#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25377#L25-3 assume !(main_~d~0#1 < 6); 25374#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25372#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25370#L25-3 assume !!(main_~d~0#1 < 6); 25368#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25366#L25-3 assume !!(main_~d~0#1 < 6); 25364#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25362#L25-3 assume !!(main_~d~0#1 < 6); 25360#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25358#L25-3 assume !!(main_~d~0#1 < 6); 25356#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25354#L25-3 assume !!(main_~d~0#1 < 6); 25352#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25350#L25-3 assume !!(main_~d~0#1 < 6); 25348#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25347#L25-3 assume !(main_~d~0#1 < 6); 25344#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25342#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25314#L25-3 assume !!(main_~d~0#1 < 6); 25340#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25338#L25-3 assume !!(main_~d~0#1 < 6); 25336#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25334#L25-3 assume !!(main_~d~0#1 < 6); 25332#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25330#L25-3 assume !!(main_~d~0#1 < 6); 25328#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25326#L25-3 assume !!(main_~d~0#1 < 6); 25324#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25322#L25-3 assume !!(main_~d~0#1 < 6); 25320#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25319#L25-3 assume !(main_~d~0#1 < 6); 25316#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25313#L24-3 assume !(main_~c~0#1 < 6); 25310#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 25309#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 25308#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25307#L25-3 assume !!(main_~d~0#1 < 6); 25306#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25305#L25-3 assume !!(main_~d~0#1 < 6); 25304#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25303#L25-3 assume !!(main_~d~0#1 < 6); 25302#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25301#L25-3 assume !!(main_~d~0#1 < 6); 25300#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25299#L25-3 assume !!(main_~d~0#1 < 6); 25298#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25297#L25-3 assume !!(main_~d~0#1 < 6); 25296#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25295#L25-3 assume !(main_~d~0#1 < 6); 25294#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25293#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25292#L25-3 assume !!(main_~d~0#1 < 6); 25291#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25290#L25-3 assume !!(main_~d~0#1 < 6); 25289#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25288#L25-3 assume !!(main_~d~0#1 < 6); 25287#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25286#L25-3 assume !!(main_~d~0#1 < 6); 25285#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25284#L25-3 assume !!(main_~d~0#1 < 6); 25283#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25282#L25-3 assume !!(main_~d~0#1 < 6); 25281#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25280#L25-3 assume !(main_~d~0#1 < 6); 25279#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25278#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25277#L25-3 assume !!(main_~d~0#1 < 6); 25276#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25275#L25-3 assume !!(main_~d~0#1 < 6); 25274#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25273#L25-3 assume !!(main_~d~0#1 < 6); 25272#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25271#L25-3 assume !!(main_~d~0#1 < 6); 25270#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25269#L25-3 assume !!(main_~d~0#1 < 6); 25268#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25267#L25-3 assume !!(main_~d~0#1 < 6); 25266#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25265#L25-3 assume !(main_~d~0#1 < 6); 25264#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25263#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25262#L25-3 assume !!(main_~d~0#1 < 6); 25261#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25260#L25-3 assume !!(main_~d~0#1 < 6); 25259#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25258#L25-3 assume !!(main_~d~0#1 < 6); 25257#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25256#L25-3 assume !!(main_~d~0#1 < 6); 25255#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25254#L25-3 assume !!(main_~d~0#1 < 6); 25253#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25252#L25-3 assume !!(main_~d~0#1 < 6); 25251#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25250#L25-3 assume !(main_~d~0#1 < 6); 25249#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25248#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25247#L25-3 assume !!(main_~d~0#1 < 6); 25246#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25245#L25-3 assume !!(main_~d~0#1 < 6); 25244#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25243#L25-3 assume !!(main_~d~0#1 < 6); 25242#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25241#L25-3 assume !!(main_~d~0#1 < 6); 25240#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25239#L25-3 assume !!(main_~d~0#1 < 6); 25238#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25237#L25-3 assume !!(main_~d~0#1 < 6); 25236#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25235#L25-3 assume !(main_~d~0#1 < 6); 25234#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25233#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25219#L25-3 assume !!(main_~d~0#1 < 6); 25232#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25231#L25-3 assume !!(main_~d~0#1 < 6); 25230#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25229#L25-3 assume !!(main_~d~0#1 < 6); 25228#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25227#L25-3 assume !!(main_~d~0#1 < 6); 25226#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25225#L25-3 assume !!(main_~d~0#1 < 6); 25224#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25223#L25-3 assume !!(main_~d~0#1 < 6); 25222#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25221#L25-3 assume !(main_~d~0#1 < 6); 25220#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25218#L24-3 assume !(main_~c~0#1 < 6); 25217#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 25216#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 25215#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25214#L25-3 assume !!(main_~d~0#1 < 6); 25213#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25212#L25-3 assume !!(main_~d~0#1 < 6); 25211#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25210#L25-3 assume !!(main_~d~0#1 < 6); 25209#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25208#L25-3 assume !!(main_~d~0#1 < 6); 25207#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25206#L25-3 assume !!(main_~d~0#1 < 6); 25205#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25204#L25-3 assume !!(main_~d~0#1 < 6); 25203#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25202#L25-3 assume !(main_~d~0#1 < 6); 25201#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25200#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25199#L25-3 assume !!(main_~d~0#1 < 6); 25198#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25197#L25-3 assume !!(main_~d~0#1 < 6); 25196#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25195#L25-3 assume !!(main_~d~0#1 < 6); 25194#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25193#L25-3 assume !!(main_~d~0#1 < 6); 25192#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25191#L25-3 assume !!(main_~d~0#1 < 6); 25190#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25189#L25-3 assume !!(main_~d~0#1 < 6); 25188#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25187#L25-3 assume !(main_~d~0#1 < 6); 25186#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25185#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25184#L25-3 assume !!(main_~d~0#1 < 6); 25183#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25182#L25-3 assume !!(main_~d~0#1 < 6); 25181#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25180#L25-3 assume !!(main_~d~0#1 < 6); 25179#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25178#L25-3 assume !!(main_~d~0#1 < 6); 25177#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25176#L25-3 assume !!(main_~d~0#1 < 6); 25175#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25174#L25-3 assume !!(main_~d~0#1 < 6); 25173#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25172#L25-3 assume !(main_~d~0#1 < 6); 25171#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25170#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25169#L25-3 assume !!(main_~d~0#1 < 6); 25168#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25167#L25-3 assume !!(main_~d~0#1 < 6); 25166#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25165#L25-3 assume !!(main_~d~0#1 < 6); 25164#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25163#L25-3 assume !!(main_~d~0#1 < 6); 25162#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25161#L25-3 assume !!(main_~d~0#1 < 6); 25160#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25159#L25-3 assume !!(main_~d~0#1 < 6); 25158#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25157#L25-3 assume !(main_~d~0#1 < 6); 25156#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25155#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25154#L25-3 assume !!(main_~d~0#1 < 6); 25153#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25152#L25-3 assume !!(main_~d~0#1 < 6); 25151#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25150#L25-3 assume !!(main_~d~0#1 < 6); 25149#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25148#L25-3 assume !!(main_~d~0#1 < 6); 25147#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25146#L25-3 assume !!(main_~d~0#1 < 6); 25145#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25144#L25-3 assume !!(main_~d~0#1 < 6); 25143#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25142#L25-3 assume !(main_~d~0#1 < 6); 25141#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25140#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25126#L25-3 assume !!(main_~d~0#1 < 6); 25139#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25138#L25-3 assume !!(main_~d~0#1 < 6); 25137#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25136#L25-3 assume !!(main_~d~0#1 < 6); 25135#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25134#L25-3 assume !!(main_~d~0#1 < 6); 25133#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25132#L25-3 assume !!(main_~d~0#1 < 6); 25131#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25130#L25-3 assume !!(main_~d~0#1 < 6); 25129#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25128#L25-3 assume !(main_~d~0#1 < 6); 25127#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25125#L24-3 assume !(main_~c~0#1 < 6); 25124#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 25123#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 25122#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25121#L25-3 assume !!(main_~d~0#1 < 6); 25120#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25119#L25-3 assume !!(main_~d~0#1 < 6); 25118#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25117#L25-3 assume !!(main_~d~0#1 < 6); 25116#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25115#L25-3 assume !!(main_~d~0#1 < 6); 25114#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25113#L25-3 assume !!(main_~d~0#1 < 6); 25112#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25111#L25-3 assume !!(main_~d~0#1 < 6); 25110#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25109#L25-3 assume !(main_~d~0#1 < 6); 25108#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25107#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25106#L25-3 assume !!(main_~d~0#1 < 6); 25105#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25104#L25-3 assume !!(main_~d~0#1 < 6); 25103#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25102#L25-3 assume !!(main_~d~0#1 < 6); 25101#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25100#L25-3 assume !!(main_~d~0#1 < 6); 25099#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25098#L25-3 assume !!(main_~d~0#1 < 6); 25097#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25096#L25-3 assume !!(main_~d~0#1 < 6); 25095#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25094#L25-3 assume !(main_~d~0#1 < 6); 25093#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25092#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25091#L25-3 assume !!(main_~d~0#1 < 6); 25090#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25089#L25-3 assume !!(main_~d~0#1 < 6); 25088#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25087#L25-3 assume !!(main_~d~0#1 < 6); 25086#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25085#L25-3 assume !!(main_~d~0#1 < 6); 25084#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25083#L25-3 assume !!(main_~d~0#1 < 6); 25082#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25081#L25-3 assume !!(main_~d~0#1 < 6); 25080#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25079#L25-3 assume !(main_~d~0#1 < 6); 25078#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25077#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25076#L25-3 assume !!(main_~d~0#1 < 6); 25075#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25074#L25-3 assume !!(main_~d~0#1 < 6); 25073#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25072#L25-3 assume !!(main_~d~0#1 < 6); 25071#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25070#L25-3 assume !!(main_~d~0#1 < 6); 25069#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25068#L25-3 assume !!(main_~d~0#1 < 6); 25067#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25066#L25-3 assume !!(main_~d~0#1 < 6); 25065#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25064#L25-3 assume !(main_~d~0#1 < 6); 25063#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25062#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25061#L25-3 assume !!(main_~d~0#1 < 6); 25060#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25059#L25-3 assume !!(main_~d~0#1 < 6); 25058#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25057#L25-3 assume !!(main_~d~0#1 < 6); 25056#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25055#L25-3 assume !!(main_~d~0#1 < 6); 25054#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25053#L25-3 assume !!(main_~d~0#1 < 6); 25052#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25051#L25-3 assume !!(main_~d~0#1 < 6); 25050#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25049#L25-3 assume !(main_~d~0#1 < 6); 25048#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25047#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25033#L25-3 assume !!(main_~d~0#1 < 6); 25046#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25045#L25-3 assume !!(main_~d~0#1 < 6); 25044#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25043#L25-3 assume !!(main_~d~0#1 < 6); 25042#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25041#L25-3 assume !!(main_~d~0#1 < 6); 25040#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25039#L25-3 assume !!(main_~d~0#1 < 6); 25038#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25037#L25-3 assume !!(main_~d~0#1 < 6); 25036#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25035#L25-3 assume !(main_~d~0#1 < 6); 25034#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25032#L24-3 assume !(main_~c~0#1 < 6); 25031#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 25030#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 24856#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25029#L25-3 assume !!(main_~d~0#1 < 6); 25028#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25027#L25-3 assume !!(main_~d~0#1 < 6); 25026#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25025#L25-3 assume !!(main_~d~0#1 < 6); 25024#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25023#L25-3 assume !!(main_~d~0#1 < 6); 25022#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25021#L25-3 assume !!(main_~d~0#1 < 6); 25019#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25017#L25-3 assume !!(main_~d~0#1 < 6); 25014#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25013#L25-3 assume !(main_~d~0#1 < 6); 25011#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 25009#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 25007#L25-3 assume !!(main_~d~0#1 < 6); 25005#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25003#L25-3 assume !!(main_~d~0#1 < 6); 25001#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25000#L25-3 assume !!(main_~d~0#1 < 6); 24997#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24995#L25-3 assume !!(main_~d~0#1 < 6); 24993#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24991#L25-3 assume !!(main_~d~0#1 < 6); 24989#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24987#L25-3 assume !!(main_~d~0#1 < 6); 24984#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24983#L25-3 assume !(main_~d~0#1 < 6); 24981#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 24979#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 24977#L25-3 assume !!(main_~d~0#1 < 6); 24975#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24973#L25-3 assume !!(main_~d~0#1 < 6); 24971#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24970#L25-3 assume !!(main_~d~0#1 < 6); 24967#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24965#L25-3 assume !!(main_~d~0#1 < 6); 24963#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24961#L25-3 assume !!(main_~d~0#1 < 6); 24959#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24957#L25-3 assume !!(main_~d~0#1 < 6); 24954#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24953#L25-3 assume !(main_~d~0#1 < 6); 24951#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 24949#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 24947#L25-3 assume !!(main_~d~0#1 < 6); 24945#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24943#L25-3 assume !!(main_~d~0#1 < 6); 24941#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24940#L25-3 assume !!(main_~d~0#1 < 6); 24937#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24935#L25-3 assume !!(main_~d~0#1 < 6); 24933#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24931#L25-3 assume !!(main_~d~0#1 < 6); 24929#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24927#L25-3 assume !!(main_~d~0#1 < 6); 24924#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24923#L25-3 assume !(main_~d~0#1 < 6); 24921#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 24919#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 24917#L25-3 assume !!(main_~d~0#1 < 6); 24915#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24913#L25-3 assume !!(main_~d~0#1 < 6); 24911#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24910#L25-3 assume !!(main_~d~0#1 < 6); 24907#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24905#L25-3 assume !!(main_~d~0#1 < 6); 24903#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24901#L25-3 assume !!(main_~d~0#1 < 6); 24899#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24897#L25-3 assume !!(main_~d~0#1 < 6); 24894#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24893#L25-3 assume !(main_~d~0#1 < 6); 24891#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 24889#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 24861#L25-3 assume !!(main_~d~0#1 < 6); 24886#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24884#L25-3 assume !!(main_~d~0#1 < 6); 24882#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24881#L25-3 assume !!(main_~d~0#1 < 6); 24878#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24876#L25-3 assume !!(main_~d~0#1 < 6); 24874#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24873#L25-3 assume !!(main_~d~0#1 < 6); 24871#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24869#L25-3 assume !!(main_~d~0#1 < 6); 24866#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24865#L25-3 assume !(main_~d~0#1 < 6); 24863#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 24860#L24-3 assume !(main_~c~0#1 < 6); 24858#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 24855#L23-3 assume !(main_~b~0#1 < 6); 24847#L22-2 main_#t~pre7#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre7#1; 24844#L22-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 24834#L23-3 [2024-10-15 00:44:01,419 INFO L747 eck$LassoCheckResult]: Loop: 24834#L23-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 24840#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 24845#L25-3 assume !!(main_~d~0#1 < 6); 25020#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25018#L25-3 assume !!(main_~d~0#1 < 6); 25016#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25015#L25-3 assume !!(main_~d~0#1 < 6); 25012#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25010#L25-3 assume !!(main_~d~0#1 < 6); 25008#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25006#L25-3 assume !!(main_~d~0#1 < 6); 25004#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 25002#L25-3 assume !!(main_~d~0#1 < 6); 24999#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24998#L25-3 assume !(main_~d~0#1 < 6); 24996#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 24994#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 24992#L25-3 assume !!(main_~d~0#1 < 6); 24990#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24988#L25-3 assume !!(main_~d~0#1 < 6); 24986#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24985#L25-3 assume !!(main_~d~0#1 < 6); 24982#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24980#L25-3 assume !!(main_~d~0#1 < 6); 24978#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24976#L25-3 assume !!(main_~d~0#1 < 6); 24974#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24972#L25-3 assume !!(main_~d~0#1 < 6); 24969#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24968#L25-3 assume !(main_~d~0#1 < 6); 24966#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 24964#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 24962#L25-3 assume !!(main_~d~0#1 < 6); 24960#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24958#L25-3 assume !!(main_~d~0#1 < 6); 24956#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24955#L25-3 assume !!(main_~d~0#1 < 6); 24952#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24950#L25-3 assume !!(main_~d~0#1 < 6); 24948#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24946#L25-3 assume !!(main_~d~0#1 < 6); 24944#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24942#L25-3 assume !!(main_~d~0#1 < 6); 24939#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24938#L25-3 assume !(main_~d~0#1 < 6); 24936#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 24934#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 24932#L25-3 assume !!(main_~d~0#1 < 6); 24930#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24928#L25-3 assume !!(main_~d~0#1 < 6); 24926#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24925#L25-3 assume !!(main_~d~0#1 < 6); 24922#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24920#L25-3 assume !!(main_~d~0#1 < 6); 24918#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24916#L25-3 assume !!(main_~d~0#1 < 6); 24914#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24912#L25-3 assume !!(main_~d~0#1 < 6); 24909#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24908#L25-3 assume !(main_~d~0#1 < 6); 24906#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 24904#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 24902#L25-3 assume !!(main_~d~0#1 < 6); 24900#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24898#L25-3 assume !!(main_~d~0#1 < 6); 24896#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24895#L25-3 assume !!(main_~d~0#1 < 6); 24892#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24890#L25-3 assume !!(main_~d~0#1 < 6); 24888#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24887#L25-3 assume !!(main_~d~0#1 < 6); 24885#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24883#L25-3 assume !!(main_~d~0#1 < 6); 24880#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24879#L25-3 assume !(main_~d~0#1 < 6); 24877#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 24875#L24-3 assume !!(main_~c~0#1 < 6);main_~d~0#1 := 0; 24849#L25-3 assume !!(main_~d~0#1 < 6); 24872#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24870#L25-3 assume !!(main_~d~0#1 < 6); 24868#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24867#L25-3 assume !!(main_~d~0#1 < 6); 24864#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24862#L25-3 assume !!(main_~d~0#1 < 6); 24859#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24857#L25-3 assume !!(main_~d~0#1 < 6); 24854#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24853#L25-3 assume !!(main_~d~0#1 < 6); 24852#L25-2 main_#t~pre4#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre4#1; 24851#L25-3 assume !(main_~d~0#1 < 6); 24850#L24-2 main_#t~pre5#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre5#1; 24848#L24-3 assume !(main_~c~0#1 < 6); 24833#L23-2 main_#t~pre6#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre6#1; 24834#L23-3 [2024-10-15 00:44:01,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:44:01,420 INFO L85 PathProgramCache]: Analyzing trace with hash -749072669, now seen corresponding path program 2 times [2024-10-15 00:44:01,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:44:01,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940890123] [2024-10-15 00:44:01,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:44:01,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:44:01,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2024-10-15 00:44:01,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:44:01,524 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:44:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:44:01,624 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:44:01,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:44:01,625 INFO L85 PathProgramCache]: Analyzing trace with hash -298958203, now seen corresponding path program 2 times [2024-10-15 00:44:01,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:44:01,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11339285] [2024-10-15 00:44:01,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:44:01,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:44:01,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:44:01,634 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:44:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:44:01,650 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:44:01,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:44:01,652 INFO L85 PathProgramCache]: Analyzing trace with hash 194283235, now seen corresponding path program 3 times [2024-10-15 00:44:01,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:44:01,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922754722] [2024-10-15 00:44:01,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:44:01,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:44:01,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:44:01,762 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:44:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:44:01,932 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:44:02,625 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:44:02,626 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:44:02,626 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:44:02,626 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:44:02,626 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:44:02,626 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:44:02,626 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:44:02,626 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:44:02,626 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration15_Loop [2024-10-15 00:44:02,626 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:44:02,626 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:44:02,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:44:02,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:44:02,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:44:02,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:44:02,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:44:02,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:44:02,669 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:44:02,670 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:44:02,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:44:02,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:44:02,671 INFO L229 MonitoredProcess]: Starting monitored process 60 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-10-15 00:44:02,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-10-15 00:44:02,672 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:44:02,672 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:44:02,683 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:44:02,683 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-10-15 00:44:02,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2024-10-15 00:44:02,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:44:02,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:44:02,696 INFO L229 MonitoredProcess]: Starting monitored process 61 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-10-15 00:44:02,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-10-15 00:44:02,697 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:44:02,697 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:44:02,708 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:44:02,708 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-10-15 00:44:02,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2024-10-15 00:44:02,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:44:02,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:44:02,720 INFO L229 MonitoredProcess]: Starting monitored process 62 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-10-15 00:44:02,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2024-10-15 00:44:02,721 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:44:02,722 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:44:02,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2024-10-15 00:44:02,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:44:02,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:44:02,750 INFO L229 MonitoredProcess]: Starting monitored process 63 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-10-15 00:44:02,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2024-10-15 00:44:02,751 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:44:02,751 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:44:02,777 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-15 00:44:02,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2024-10-15 00:44:02,781 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:44:02,781 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:44:02,782 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:44:02,782 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:44:02,782 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:44:02,782 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:44:02,782 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:44:02,782 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:44:02,782 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_4.c_Iteration15_Loop [2024-10-15 00:44:02,782 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:44:02,782 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:44:02,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:44:02,785 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:44:02,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:44:02,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:44:02,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:44:02,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:44:02,828 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:44:02,829 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:44:02,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:44:02,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:44:02,830 INFO L229 MonitoredProcess]: Starting monitored process 64 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-10-15 00:44:02,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2024-10-15 00:44:02,833 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:44:02,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:44:02,842 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:44:02,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:44:02,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:44:02,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:44:02,843 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:44:02,843 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:44:02,844 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:44:02,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2024-10-15 00:44:02,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:44:02,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:44:02,856 INFO L229 MonitoredProcess]: Starting monitored process 65 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-10-15 00:44:02,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2024-10-15 00:44:02,858 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:44:02,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:44:02,868 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:44:02,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:44:02,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:44:02,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:44:02,869 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:44:02,869 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:44:02,872 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:44:02,874 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-15 00:44:02,874 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 00:44:02,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:44:02,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:44:02,875 INFO L229 MonitoredProcess]: Starting monitored process 66 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-10-15 00:44:02,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2024-10-15 00:44:02,877 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:44:02,877 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:44:02,877 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:44:02,878 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~b~0#1) = -2*ULTIMATE.start_main_~b~0#1 + 11 Supporting invariants [] [2024-10-15 00:44:02,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2024-10-15 00:44:02,888 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 00:44:02,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:44:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:44:03,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:44:03,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:44:03,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2024-10-15 00:44:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:44:03,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:44:03,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:44:04,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1527 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1527 trivial. 0 not checked. [2024-10-15 00:44:04,035 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-15 00:44:04,035 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 657 states and 708 transitions. cyclomatic complexity: 53 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:44:04,057 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 657 states and 708 transitions. cyclomatic complexity: 53. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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) Result 1772 states and 1910 transitions. Complement of second has 7 states. [2024-10-15 00:44:04,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-15 00:44:04,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:44:04,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-10-15 00:44:04,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 564 letters. Loop has 93 letters. [2024-10-15 00:44:04,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:44:04,060 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:44:04,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:44:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:44:04,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:44:04,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:44:04,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:44:04,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:44:04,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:44:05,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1527 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1527 trivial. 0 not checked. [2024-10-15 00:44:05,086 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-15 00:44:05,086 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 657 states and 708 transitions. cyclomatic complexity: 53 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:44:05,104 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 657 states and 708 transitions. cyclomatic complexity: 53. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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) Result 1772 states and 1910 transitions. Complement of second has 7 states. [2024-10-15 00:44:05,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-15 00:44:05,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:44:05,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-10-15 00:44:05,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 564 letters. Loop has 93 letters. [2024-10-15 00:44:05,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:44:05,107 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:44:05,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:44:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:44:05,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:44:05,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:44:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:44:05,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:44:05,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:44:06,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1527 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1527 trivial. 0 not checked. [2024-10-15 00:44:06,120 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-15 00:44:06,120 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 657 states and 708 transitions. cyclomatic complexity: 53 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:44:06,139 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 657 states and 708 transitions. cyclomatic complexity: 53. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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) Result 1304 states and 1406 transitions. Complement of second has 6 states. [2024-10-15 00:44:06,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-15 00:44:06,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:44:06,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2024-10-15 00:44:06,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 564 letters. Loop has 93 letters. [2024-10-15 00:44:06,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:44:06,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 657 letters. Loop has 93 letters. [2024-10-15 00:44:06,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:44:06,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 564 letters. Loop has 186 letters. [2024-10-15 00:44:06,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:44:06,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1304 states and 1406 transitions. [2024-10-15 00:44:06,153 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-15 00:44:06,153 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1304 states to 0 states and 0 transitions. [2024-10-15 00:44:06,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-15 00:44:06,153 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-15 00:44:06,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-15 00:44:06,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:44:06,154 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:44:06,154 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:44:06,154 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:44:06,154 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-10-15 00:44:06,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-15 00:44:06,154 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-15 00:44:06,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-15 00:44:06,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.10 12:44:06 BoogieIcfgContainer [2024-10-15 00:44:06,161 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-15 00:44:06,162 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 00:44:06,162 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 00:44:06,162 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 00:44:06,163 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:43:30" (3/4) ... [2024-10-15 00:44:06,164 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-15 00:44:06,165 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 00:44:06,166 INFO L158 Benchmark]: Toolchain (without parser) took 36460.15ms. Allocated memory was 184.5MB in the beginning and 436.2MB in the end (delta: 251.7MB). Free memory was 115.6MB in the beginning and 311.9MB in the end (delta: -196.3MB). Peak memory consumption was 58.3MB. Max. memory is 16.1GB. [2024-10-15 00:44:06,166 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 109.1MB. Free memory is still 68.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:44:06,166 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.42ms. Allocated memory is still 184.5MB. Free memory was 115.4MB in the beginning and 155.9MB in the end (delta: -40.5MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2024-10-15 00:44:06,166 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.29ms. Allocated memory is still 184.5MB. Free memory was 155.9MB in the beginning and 154.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 00:44:06,167 INFO L158 Benchmark]: Boogie Preprocessor took 54.65ms. Allocated memory is still 184.5MB. Free memory was 154.1MB in the beginning and 152.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:44:06,167 INFO L158 Benchmark]: RCFGBuilder took 275.34ms. Allocated memory is still 184.5MB. Free memory was 152.8MB in the beginning and 142.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-15 00:44:06,167 INFO L158 Benchmark]: BuchiAutomizer took 35706.81ms. Allocated memory was 184.5MB in the beginning and 436.2MB in the end (delta: 251.7MB). Free memory was 142.3MB in the beginning and 311.9MB in the end (delta: -169.6MB). Peak memory consumption was 85.2MB. Max. memory is 16.1GB. [2024-10-15 00:44:06,167 INFO L158 Benchmark]: Witness Printer took 3.55ms. Allocated memory is still 436.2MB. Free memory is still 311.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:44:06,169 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 109.1MB. Free memory is still 68.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 317.42ms. Allocated memory is still 184.5MB. Free memory was 115.4MB in the beginning and 155.9MB in the end (delta: -40.5MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.29ms. Allocated memory is still 184.5MB. Free memory was 155.9MB in the beginning and 154.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.65ms. Allocated memory is still 184.5MB. Free memory was 154.1MB in the beginning and 152.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 275.34ms. Allocated memory is still 184.5MB. Free memory was 152.8MB in the beginning and 142.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 35706.81ms. Allocated memory was 184.5MB in the beginning and 436.2MB in the end (delta: 251.7MB). Free memory was 142.3MB in the beginning and 311.9MB in the end (delta: -169.6MB). Peak memory consumption was 85.2MB. Max. memory is 16.1GB. * Witness Printer took 3.55ms. Allocated memory is still 436.2MB. Free memory is still 311.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 15 terminating modules (8 trivial, 4 deterministic, 3 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 deterministic module has affine ranking function (((long long) -2 * d) + 11) and consists of 4 locations. One nondeterministic module has affine ranking function (((long long) -2 * d) + 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. 8 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 35.6s and 16 iterations. TraceHistogramMax:216. Analysis of lassos took 27.0s. Construction of modules took 0.2s. Büchi inclusion checks took 7.9s. Highest rank in rank-based complementation 3. Minimization of det autom 9. Minimization of nondet autom 6. Automata minimization 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 1376 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 3, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 59499/59499 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 350 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 337 mSDsluCounter, 485 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 239 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 217 IncrementalHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 246 mSDtfsCounter, 217 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI8 SFLT7 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital13 mio100 ax100 hnf100 lsp75 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 17 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-10-15 00:44:06,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-15 00:44:06,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-15 00:44:06,596 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-10-15 00:44:06,797 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-10-15 00:44:06,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-15 00:44:07,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE