./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/java_Sequence-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/java_Sequence-alloca.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 64bit --witnessprinter.graph.data.programhash d628f3524885345eb9e2318f2d0dbb026e233c3bcc51319b2ad8fc1a71d35580 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 07:07:14,522 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:07:14,573 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-01-10 07:07:14,576 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:07:14,576 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:07:14,596 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:07:14,597 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:07:14,597 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:07:14,597 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:07:14,597 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:07:14,598 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:07:14,598 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:07:14,598 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:07:14,598 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:07:14,598 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:07:14,598 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:07:14,598 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:07:14,599 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:07:14,599 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:07:14,599 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:07:14,599 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:07:14,599 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:07:14,599 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:07:14,599 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:07:14,599 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:07:14,599 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:07:14,600 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:07:14,600 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:07:14,600 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:07:14,600 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:07:14,600 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:07:14,600 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:07:14,600 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:07:14,600 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:07:14,600 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:07:14,601 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:07:14,601 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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-jdk21/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d628f3524885345eb9e2318f2d0dbb026e233c3bcc51319b2ad8fc1a71d35580 [2025-01-10 07:07:14,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:07:14,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:07:14,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:07:14,807 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:07:14,807 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:07:14,808 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/java_Sequence-alloca.i [2025-01-10 07:07:15,945 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b2d042594/a44c2067f1c945879fdc96638c119f2f/FLAG151206872 [2025-01-10 07:07:16,193 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:07:16,193 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_Sequence-alloca.i [2025-01-10 07:07:16,201 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b2d042594/a44c2067f1c945879fdc96638c119f2f/FLAG151206872 [2025-01-10 07:07:16,515 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b2d042594/a44c2067f1c945879fdc96638c119f2f [2025-01-10 07:07:16,517 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:07:16,518 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:07:16,518 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:07:16,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:07:16,521 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:07:16,522 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:07:16" (1/1) ... [2025-01-10 07:07:16,522 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cc6820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:07:16, skipping insertion in model container [2025-01-10 07:07:16,523 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:07:16" (1/1) ... [2025-01-10 07:07:16,539 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:07:16,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:07:16,745 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:07:16,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:07:16,798 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:07:16,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:07:16 WrapperNode [2025-01-10 07:07:16,799 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:07:16,800 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:07:16,800 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:07:16,800 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:07:16,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:07:16" (1/1) ... [2025-01-10 07:07:16,810 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:07:16" (1/1) ... [2025-01-10 07:07:16,820 INFO L138 Inliner]: procedures = 109, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2025-01-10 07:07:16,820 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:07:16,821 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:07:16,821 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:07:16,821 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:07:16,826 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:07:16" (1/1) ... [2025-01-10 07:07:16,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:07:16" (1/1) ... [2025-01-10 07:07:16,828 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:07:16" (1/1) ... [2025-01-10 07:07:16,836 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [6, 4, 4]. 43 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 7 writes are split as follows [3, 2, 2]. [2025-01-10 07:07:16,836 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:07:16" (1/1) ... [2025-01-10 07:07:16,836 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:07:16" (1/1) ... [2025-01-10 07:07:16,840 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:07:16" (1/1) ... [2025-01-10 07:07:16,841 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:07:16" (1/1) ... [2025-01-10 07:07:16,843 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:07:16" (1/1) ... [2025-01-10 07:07:16,843 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:07:16" (1/1) ... [2025-01-10 07:07:16,844 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:07:16" (1/1) ... [2025-01-10 07:07:16,847 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:07:16,848 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:07:16,848 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:07:16,848 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:07:16,849 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:07:16" (1/1) ... [2025-01-10 07:07:16,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:07:16,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:07:16,873 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:07:16,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-01-10 07:07:16,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 07:07:16,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 07:07:16,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 07:07:16,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 07:07:16,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 07:07:16,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 07:07:16,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 07:07:16,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 07:07:16,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:07:16,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:07:16,959 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:07:16,960 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:07:17,060 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-01-10 07:07:17,063 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:07:17,069 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:07:17,069 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-10 07:07:17,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:07:17 BoogieIcfgContainer [2025-01-10 07:07:17,069 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:07:17,070 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:07:17,070 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:07:17,074 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:07:17,075 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:07:17,075 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:07:16" (1/3) ... [2025-01-10 07:07:17,077 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a393884 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:07:17, skipping insertion in model container [2025-01-10 07:07:17,077 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:07:17,077 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:07:16" (2/3) ... [2025-01-10 07:07:17,078 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a393884 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:07:17, skipping insertion in model container [2025-01-10 07:07:17,078 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:07:17,078 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:07:17" (3/3) ... [2025-01-10 07:07:17,079 INFO L363 chiAutomizerObserver]: Analyzing ICFG java_Sequence-alloca.i [2025-01-10 07:07:17,116 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:07:17,116 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:07:17,116 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:07:17,117 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:07:17,117 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:07:17,117 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:07:17,117 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:07:17,117 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:07:17,122 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.3333333333333333) 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) [2025-01-10 07:07:17,133 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-01-10 07:07:17,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:07:17,133 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:07:17,136 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:07:17,136 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:07:17,136 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:07:17,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.3333333333333333) 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) [2025-01-10 07:07:17,137 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-01-10 07:07:17,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:07:17,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:07:17,137 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:07:17,137 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:07:17,142 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#0(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(0, main_~i~0#1.base, main_~i~0#1.offset, 4);" [2025-01-10 07:07:17,142 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-01-10 07:07:17,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:07:17,148 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2025-01-10 07:07:17,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:07:17,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736490375] [2025-01-10 07:07:17,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:07:17,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:07:17,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:07:17,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:07:17,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:07:17,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:07:17,237 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:07:17,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:07:17,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:07:17,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:07:17,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:07:17,273 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:07:17,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:07:17,275 INFO L85 PathProgramCache]: Analyzing trace with hash 35849, now seen corresponding path program 1 times [2025-01-10 07:07:17,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:07:17,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591927618] [2025-01-10 07:07:17,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:07:17,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:07:17,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:07:17,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:07:17,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:07:17,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:07:17,290 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:07:17,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:07:17,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:07:17,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:07:17,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:07:17,299 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:07:17,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:07:17,301 INFO L85 PathProgramCache]: Analyzing trace with hash 28694791, now seen corresponding path program 1 times [2025-01-10 07:07:17,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:07:17,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140938954] [2025-01-10 07:07:17,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:07:17,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:07:17,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:07:17,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:07:17,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:07:17,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:07:17,332 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:07:17,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:07:17,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:07:17,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:07:17,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:07:17,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:07:17,833 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:07:17,834 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:07:17,834 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:07:17,834 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:07:17,835 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:07:17,835 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:07:17,835 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:07:17,835 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:07:17,835 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_Sequence-alloca.i_Iteration1_Lasso [2025-01-10 07:07:17,835 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:07:17,835 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:07:17,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:07:17,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:07:17,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:07:17,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:07:17,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:07:17,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:07:17,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:07:17,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:07:17,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:07:17,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:07:17,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:07:17,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:07:17,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:07:18,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:07:18,415 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:07:18,417 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:07:18,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:07:18,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:07:18,421 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:07:18,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-01-10 07:07:18,423 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 [2025-01-10 07:07:18,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:07:18,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:07:18,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:07:18,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:07:18,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:07:18,437 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:07:18,437 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:07:18,439 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:07:18,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-01-10 07:07:18,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:07:18,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:07:18,447 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:07:18,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-01-10 07:07:18,450 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 [2025-01-10 07:07:18,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:07:18,463 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:07:18,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:07:18,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:07:18,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:07:18,464 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:07:18,464 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:07:18,465 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:07:18,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-01-10 07:07:18,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:07:18,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:07:18,479 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:07:18,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-01-10 07:07:18,482 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 [2025-01-10 07:07:18,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:07:18,494 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:07:18,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:07:18,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:07:18,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:07:18,495 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:07:18,495 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:07:18,498 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:07:18,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-01-10 07:07:18,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:07:18,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:07:18,507 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:07:18,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-01-10 07:07:18,510 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 [2025-01-10 07:07:18,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:07:18,520 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:07:18,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:07:18,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:07:18,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:07:18,521 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:07:18,521 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:07:18,523 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:07:18,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-01-10 07:07:18,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:07:18,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:07:18,530 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:07:18,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-01-10 07:07:18,535 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 [2025-01-10 07:07:18,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:07:18,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:07:18,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:07:18,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:07:18,549 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:07:18,550 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:07:18,553 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:07:18,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-01-10 07:07:18,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:07:18,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:07:18,561 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:07:18,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-01-10 07:07:18,564 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 [2025-01-10 07:07:18,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:07:18,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:07:18,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:07:18,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:07:18,578 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:07:18,578 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:07:18,581 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:07:18,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-01-10 07:07:18,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:07:18,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:07:18,589 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:07:18,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-01-10 07:07:18,591 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 [2025-01-10 07:07:18,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:07:18,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:07:18,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:07:18,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:07:18,607 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:07:18,607 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:07:18,610 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:07:18,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-01-10 07:07:18,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:07:18,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:07:18,618 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:07:18,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-01-10 07:07:18,620 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 [2025-01-10 07:07:18,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:07:18,631 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:07:18,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:07:18,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:07:18,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:07:18,632 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:07:18,632 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:07:18,633 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:07:18,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-01-10 07:07:18,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:07:18,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:07:18,641 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:07:18,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-01-10 07:07:18,643 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 [2025-01-10 07:07:18,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:07:18,653 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:07:18,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:07:18,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:07:18,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:07:18,654 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:07:18,654 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:07:18,656 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:07:18,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-01-10 07:07:18,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:07:18,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:07:18,664 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:07:18,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-01-10 07:07:18,666 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 [2025-01-10 07:07:18,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:07:18,676 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:07:18,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:07:18,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:07:18,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:07:18,677 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:07:18,677 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:07:18,678 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:07:18,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-01-10 07:07:18,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:07:18,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:07:18,686 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:07:18,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-01-10 07:07:18,689 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 [2025-01-10 07:07:18,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:07:18,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:07:18,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:07:18,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:07:18,700 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:07:18,700 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:07:18,703 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:07:18,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-01-10 07:07:18,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:07:18,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:07:18,711 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:07:18,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-01-10 07:07:18,713 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 [2025-01-10 07:07:18,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:07:18,723 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:07:18,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:07:18,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:07:18,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:07:18,724 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:07:18,724 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:07:18,725 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:07:18,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-01-10 07:07:18,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:07:18,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:07:18,732 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:07:18,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-01-10 07:07:18,735 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 [2025-01-10 07:07:18,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:07:18,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:07:18,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:07:18,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:07:18,748 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:07:18,748 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:07:18,752 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:07:18,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-01-10 07:07:18,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:07:18,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:07:18,761 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:07:18,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-01-10 07:07:18,764 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 [2025-01-10 07:07:18,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:07:18,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:07:18,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:07:18,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:07:18,779 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:07:18,779 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:07:18,785 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:07:18,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-01-10 07:07:18,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:07:18,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:07:18,794 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:07:18,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-01-10 07:07:18,796 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 [2025-01-10 07:07:18,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:07:18,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:07:18,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:07:18,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:07:18,808 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:07:18,808 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:07:18,812 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:07:18,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-01-10 07:07:18,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:07:18,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:07:18,821 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:07:18,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-01-10 07:07:18,824 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 [2025-01-10 07:07:18,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:07:18,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:07:18,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:07:18,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:07:18,835 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:07:18,835 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:07:18,838 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:07:18,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-01-10 07:07:18,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:07:18,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:07:18,850 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:07:18,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-01-10 07:07:18,852 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 [2025-01-10 07:07:18,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:07:18,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:07:18,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:07:18,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:07:18,866 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:07:18,866 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:07:18,870 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:07:18,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-01-10 07:07:18,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:07:18,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:07:18,879 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:07:18,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-01-10 07:07:18,882 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 [2025-01-10 07:07:18,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:07:18,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:07:18,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:07:18,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:07:18,898 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:07:18,898 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:07:18,901 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:07:18,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-01-10 07:07:18,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:07:18,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:07:18,909 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:07:18,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-01-10 07:07:18,912 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 [2025-01-10 07:07:18,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:07:18,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:07:18,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:07:18,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:07:18,927 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:07:18,927 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:07:18,932 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:07:18,945 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-01-10 07:07:18,947 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-01-10 07:07:18,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:07:18,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:07:18,951 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:07:18,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-01-10 07:07:18,953 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:07:18,964 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-01-10 07:07:18,964 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:07:18,964 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_1) = -2*v_rep(select (select #memory_int#2 ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_1 + 199 Supporting invariants [] [2025-01-10 07:07:18,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-01-10 07:07:19,001 INFO L156 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2025-01-10 07:07:19,007 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-01-10 07:07:19,007 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-01-10 07:07:19,007 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~i~0!base,]]] [2025-01-10 07:07:19,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:07:19,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:07:19,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:07:19,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:07:19,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:07:19,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:07:19,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:07:19,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:07:19,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:07:19,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:07:19,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:07:19,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 07:07:19,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:07:19,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:07:19,114 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-01-10 07:07:19,116 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.3333333333333333) 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) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:07:19,165 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.3333333333333333) 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). Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 30 states and 37 transitions. Complement of second has 10 states. [2025-01-10 07:07:19,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-01-10 07:07:19,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:07:19,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2025-01-10 07:07:19,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 2 letters. Loop has 3 letters. [2025-01-10 07:07:19,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:07:19,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 5 letters. Loop has 3 letters. [2025-01-10 07:07:19,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:07:19,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 2 letters. Loop has 6 letters. [2025-01-10 07:07:19,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:07:19,179 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2025-01-10 07:07:19,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:07:19,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 11 states and 13 transitions. [2025-01-10 07:07:19,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-01-10 07:07:19,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-01-10 07:07:19,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2025-01-10 07:07:19,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:07:19,185 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-01-10 07:07:19,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2025-01-10 07:07:19,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-01-10 07:07:19,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 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) [2025-01-10 07:07:19,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2025-01-10 07:07:19,212 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-01-10 07:07:19,212 INFO L432 stractBuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-01-10 07:07:19,212 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:07:19,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2025-01-10 07:07:19,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:07:19,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:07:19,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:07:19,212 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-01-10 07:07:19,212 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:07:19,213 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#0(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(0, main_~i~0#1.base, main_~i~0#1.offset, 4);" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume !(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;" "call write~int#1(5, main_~j~0#1.base, main_~j~0#1.offset, 4);" [2025-01-10 07:07:19,213 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem9#1 < 21;havoc main_#t~mem9#1;" "call main_#t~mem10#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem10#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(3 + main_#t~mem11#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem11#1;" [2025-01-10 07:07:19,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-01-10 07:07:19,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:07:19,213 INFO L85 PathProgramCache]: Analyzing trace with hash 28694857, now seen corresponding path program 1 times [2025-01-10 07:07:19,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:07:19,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570045797] [2025-01-10 07:07:19,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:07:19,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:07:19,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:07:19,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:07:19,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:07:19,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:07:19,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:07:19,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:07:19,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570045797] [2025-01-10 07:07:19,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570045797] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:07:19,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:07:19,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 07:07:19,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285854770] [2025-01-10 07:07:19,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:07:19,351 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:07:19,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:07:19,352 INFO L85 PathProgramCache]: Analyzing trace with hash 50744, now seen corresponding path program 1 times [2025-01-10 07:07:19,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:07:19,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419995899] [2025-01-10 07:07:19,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:07:19,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:07:19,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:07:19,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:07:19,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:07:19,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:07:19,357 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:07:19,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:07:19,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:07:19,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:07:19,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:07:19,361 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:07:19,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:07:19,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 07:07:19,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 07:07:19,409 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:07:19,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:07:19,429 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2025-01-10 07:07:19,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2025-01-10 07:07:19,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:07:19,430 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 13 states and 14 transitions. [2025-01-10 07:07:19,431 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-01-10 07:07:19,431 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-01-10 07:07:19,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2025-01-10 07:07:19,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:07:19,431 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 14 transitions. [2025-01-10 07:07:19,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2025-01-10 07:07:19,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2025-01-10 07:07:19,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 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) [2025-01-10 07:07:19,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2025-01-10 07:07:19,433 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 12 transitions. [2025-01-10 07:07:19,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 07:07:19,433 INFO L432 stractBuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2025-01-10 07:07:19,434 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 07:07:19,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2025-01-10 07:07:19,434 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:07:19,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:07:19,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:07:19,435 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 07:07:19,435 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:07:19,435 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#0(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(0, main_~i~0#1.base, main_~i~0#1.offset, 4);" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume !(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;" "call write~int#1(5, main_~j~0#1.base, main_~j~0#1.offset, 4);" [2025-01-10 07:07:19,435 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem9#1 < 21;havoc main_#t~mem9#1;" "call main_#t~mem10#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem10#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(3 + main_#t~mem11#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem11#1;" [2025-01-10 07:07:19,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:07:19,436 INFO L85 PathProgramCache]: Analyzing trace with hash 148032901, now seen corresponding path program 1 times [2025-01-10 07:07:19,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:07:19,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926052046] [2025-01-10 07:07:19,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:07:19,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:07:19,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:07:19,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:07:19,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:07:19,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:07:19,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:07:19,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:07:19,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926052046] [2025-01-10 07:07:19,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926052046] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:07:19,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132834253] [2025-01-10 07:07:19,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:07:19,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:07:19,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:07:19,615 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:07:19,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-01-10 07:07:19,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:07:19,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:07:19,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:07:19,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:07:19,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 07:07:19,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:07:19,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 07:07:19,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-01-10 07:07:19,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 07:07:19,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:07:19,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:07:19,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:07:19,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132834253] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:07:19,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:07:19,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2025-01-10 07:07:19,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723398295] [2025-01-10 07:07:19,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:07:19,739 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:07:19,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:07:19,739 INFO L85 PathProgramCache]: Analyzing trace with hash 50744, now seen corresponding path program 2 times [2025-01-10 07:07:19,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:07:19,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942324304] [2025-01-10 07:07:19,739 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:07:19,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:07:19,743 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:07:19,745 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:07:19,745 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:07:19,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:07:19,745 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:07:19,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:07:19,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:07:19,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:07:19,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:07:19,749 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:07:19,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:07:19,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 07:07:19,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-01-10 07:07:19,807 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 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) [2025-01-10 07:07:19,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:07:19,866 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2025-01-10 07:07:19,866 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2025-01-10 07:07:19,867 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:07:19,867 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 22 states and 23 transitions. [2025-01-10 07:07:19,867 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-01-10 07:07:19,867 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-01-10 07:07:19,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 23 transitions. [2025-01-10 07:07:19,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:07:19,867 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 23 transitions. [2025-01-10 07:07:19,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 23 transitions. [2025-01-10 07:07:19,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2025-01-10 07:07:19,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.05) internal successors, (21), 19 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) [2025-01-10 07:07:19,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2025-01-10 07:07:19,868 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 21 transitions. [2025-01-10 07:07:19,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 07:07:19,871 INFO L432 stractBuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2025-01-10 07:07:19,871 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-01-10 07:07:19,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 21 transitions. [2025-01-10 07:07:19,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:07:19,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:07:19,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:07:19,871 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 1, 1, 1, 1] [2025-01-10 07:07:19,871 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:07:19,871 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#0(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(0, main_~i~0#1.base, main_~i~0#1.offset, 4);" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume !(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;" "call write~int#1(5, main_~j~0#1.base, main_~j~0#1.offset, 4);" [2025-01-10 07:07:19,871 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem9#1 < 21;havoc main_#t~mem9#1;" "call main_#t~mem10#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem10#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(3 + main_#t~mem11#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem11#1;" [2025-01-10 07:07:19,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:07:19,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1563723337, now seen corresponding path program 2 times [2025-01-10 07:07:19,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:07:19,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628248310] [2025-01-10 07:07:19,872 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:07:19,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:07:19,881 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-01-10 07:07:19,897 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 07:07:19,897 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:07:19,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:07:20,263 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:07:20,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:07:20,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628248310] [2025-01-10 07:07:20,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628248310] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:07:20,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441128907] [2025-01-10 07:07:20,264 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:07:20,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:07:20,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:07:20,267 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:07:20,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-01-10 07:07:20,301 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-01-10 07:07:20,318 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 07:07:20,318 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:07:20,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:07:20,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 07:07:20,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:07:20,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 07:07:20,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-01-10 07:07:20,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 07:07:20,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 07:07:20,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 07:07:20,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 07:07:20,367 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:07:20,367 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:07:20,447 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:07:20,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441128907] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:07:20,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:07:20,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 19 [2025-01-10 07:07:20,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678298706] [2025-01-10 07:07:20,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:07:20,448 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:07:20,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:07:20,448 INFO L85 PathProgramCache]: Analyzing trace with hash 50744, now seen corresponding path program 3 times [2025-01-10 07:07:20,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:07:20,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426284650] [2025-01-10 07:07:20,448 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:07:20,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:07:20,456 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:07:20,457 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:07:20,457 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:07:20,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:07:20,457 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:07:20,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:07:20,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:07:20,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:07:20,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:07:20,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:07:20,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:07:20,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 07:07:20,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2025-01-10 07:07:20,514 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. cyclomatic complexity: 3 Second operand has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 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) [2025-01-10 07:07:20,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:07:20,636 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2025-01-10 07:07:20,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 47 transitions. [2025-01-10 07:07:20,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:07:20,637 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 40 states and 41 transitions. [2025-01-10 07:07:20,637 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-01-10 07:07:20,637 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-01-10 07:07:20,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 41 transitions. [2025-01-10 07:07:20,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:07:20,637 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 41 transitions. [2025-01-10 07:07:20,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 41 transitions. [2025-01-10 07:07:20,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2025-01-10 07:07:20,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 37 states have internal predecessors, (39), 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) [2025-01-10 07:07:20,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2025-01-10 07:07:20,642 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 39 transitions. [2025-01-10 07:07:20,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-10 07:07:20,644 INFO L432 stractBuchiCegarLoop]: Abstraction has 38 states and 39 transitions. [2025-01-10 07:07:20,644 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-01-10 07:07:20,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 39 transitions. [2025-01-10 07:07:20,646 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:07:20,646 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:07:20,646 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:07:20,646 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 10, 1, 1, 1, 1] [2025-01-10 07:07:20,646 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:07:20,647 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#0(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(0, main_~i~0#1.base, main_~i~0#1.offset, 4);" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume !(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;" "call write~int#1(5, main_~j~0#1.base, main_~j~0#1.offset, 4);" [2025-01-10 07:07:20,647 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem9#1 < 21;havoc main_#t~mem9#1;" "call main_#t~mem10#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem10#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(3 + main_#t~mem11#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem11#1;" [2025-01-10 07:07:20,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:07:20,647 INFO L85 PathProgramCache]: Analyzing trace with hash -2108491319, now seen corresponding path program 3 times [2025-01-10 07:07:20,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:07:20,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202433152] [2025-01-10 07:07:20,647 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:07:20,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:07:20,667 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 11 equivalence classes. [2025-01-10 07:07:20,710 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 07:07:20,710 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 07:07:20,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:07:21,899 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:07:21,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:07:21,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202433152] [2025-01-10 07:07:21,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202433152] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:07:21,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007498079] [2025-01-10 07:07:21,899 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:07:21,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:07:21,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:07:21,902 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:07:21,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-01-10 07:07:21,957 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 11 equivalence classes. [2025-01-10 07:07:22,267 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 07:07:22,267 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 07:07:22,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:07:22,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-10 07:07:22,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:07:22,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 07:07:22,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-01-10 07:07:22,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 07:07:22,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 07:07:22,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 07:07:22,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 07:07:22,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 07:07:22,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 07:07:22,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 07:07:22,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 07:07:22,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 07:07:22,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 07:07:22,432 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:07:22,432 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:07:22,656 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:07:22,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007498079] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:07:22,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:07:22,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 14] total 35 [2025-01-10 07:07:22,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269489500] [2025-01-10 07:07:22,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:07:22,657 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:07:22,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:07:22,657 INFO L85 PathProgramCache]: Analyzing trace with hash 50744, now seen corresponding path program 4 times [2025-01-10 07:07:22,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:07:22,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61836915] [2025-01-10 07:07:22,657 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:07:22,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:07:22,662 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-01-10 07:07:22,663 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:07:22,663 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:07:22,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:07:22,664 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:07:22,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:07:22,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:07:22,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:07:22,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:07:22,666 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:07:22,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:07:22,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-10 07:07:22,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=502, Invalid=688, Unknown=0, NotChecked=0, Total=1190 [2025-01-10 07:07:22,718 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. cyclomatic complexity: 3 Second operand has 35 states, 35 states have (on average 2.4571428571428573) internal successors, (86), 35 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:07:23,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:07:23,042 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2025-01-10 07:07:23,042 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 89 transitions. [2025-01-10 07:07:23,043 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:07:23,043 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 76 states and 77 transitions. [2025-01-10 07:07:23,043 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-01-10 07:07:23,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-01-10 07:07:23,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 77 transitions. [2025-01-10 07:07:23,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:07:23,044 INFO L218 hiAutomatonCegarLoop]: Abstraction has 76 states and 77 transitions. [2025-01-10 07:07:23,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 77 transitions. [2025-01-10 07:07:23,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2025-01-10 07:07:23,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 73 states have internal predecessors, (75), 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) [2025-01-10 07:07:23,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2025-01-10 07:07:23,048 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 75 transitions. [2025-01-10 07:07:23,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-01-10 07:07:23,050 INFO L432 stractBuchiCegarLoop]: Abstraction has 74 states and 75 transitions. [2025-01-10 07:07:23,050 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-01-10 07:07:23,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 75 transitions. [2025-01-10 07:07:23,051 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:07:23,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:07:23,054 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:07:23,055 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [23, 22, 22, 1, 1, 1, 1] [2025-01-10 07:07:23,055 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:07:23,055 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#0(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(0, main_~i~0#1.base, main_~i~0#1.offset, 4);" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume !(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;" "call write~int#1(5, main_~j~0#1.base, main_~j~0#1.offset, 4);" [2025-01-10 07:07:23,055 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem9#1 < 21;havoc main_#t~mem9#1;" "call main_#t~mem10#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem10#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(3 + main_#t~mem11#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem11#1;" [2025-01-10 07:07:23,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:07:23,056 INFO L85 PathProgramCache]: Analyzing trace with hash -518635319, now seen corresponding path program 4 times [2025-01-10 07:07:23,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:07:23,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529911108] [2025-01-10 07:07:23,056 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:07:23,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:07:23,077 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 71 statements into 2 equivalence classes. [2025-01-10 07:07:23,108 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-01-10 07:07:23,108 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:07:23,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:07:24,915 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:07:24,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:07:24,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529911108] [2025-01-10 07:07:24,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529911108] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:07:24,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109200086] [2025-01-10 07:07:24,916 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:07:24,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:07:24,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:07:24,918 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:07:24,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-01-10 07:07:24,981 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 71 statements into 2 equivalence classes. [2025-01-10 07:07:25,709 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-01-10 07:07:25,709 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:07:25,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:07:25,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-01-10 07:07:25,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:07:25,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 07:07:25,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-01-10 07:07:25,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 07:07:25,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 07:07:25,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 07:07:25,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 07:07:25,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 07:07:25,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 07:07:25,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 07:07:25,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 07:07:25,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 07:07:25,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 07:07:25,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 07:07:25,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 07:07:25,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 07:07:25,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 07:07:25,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 07:07:25,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 07:07:25,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 07:07:25,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 07:07:25,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 07:07:25,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 07:07:25,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 07:07:25,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 07:07:25,938 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:07:25,939 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:07:26,622 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:07:26,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109200086] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:07:26,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:07:26,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 50 [2025-01-10 07:07:26,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117491999] [2025-01-10 07:07:26,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:07:26,626 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:07:26,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:07:26,626 INFO L85 PathProgramCache]: Analyzing trace with hash 50744, now seen corresponding path program 5 times [2025-01-10 07:07:26,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:07:26,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031026025] [2025-01-10 07:07:26,626 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:07:26,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:07:26,629 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:07:26,631 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:07:26,631 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:07:26,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:07:26,631 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:07:26,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:07:26,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:07:26,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:07:26,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:07:26,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:07:26,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:07:26,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-01-10 07:07:26,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2025-01-10 07:07:26,687 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. cyclomatic complexity: 3 Second operand has 50 states, 50 states have (on average 2.8) internal successors, (140), 50 states have internal predecessors, (140), 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) [2025-01-10 07:07:27,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:07:27,729 INFO L93 Difference]: Finished difference Result 172 states and 173 transitions. [2025-01-10 07:07:27,729 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 172 states and 173 transitions. [2025-01-10 07:07:27,731 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:07:27,732 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 172 states to 148 states and 149 transitions. [2025-01-10 07:07:27,732 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-01-10 07:07:27,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-01-10 07:07:27,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 148 states and 149 transitions. [2025-01-10 07:07:27,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:07:27,732 INFO L218 hiAutomatonCegarLoop]: Abstraction has 148 states and 149 transitions. [2025-01-10 07:07:27,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states and 149 transitions. [2025-01-10 07:07:27,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2025-01-10 07:07:27,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 146 states have (on average 1.0068493150684932) internal successors, (147), 145 states have internal predecessors, (147), 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) [2025-01-10 07:07:27,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 147 transitions. [2025-01-10 07:07:27,737 INFO L240 hiAutomatonCegarLoop]: Abstraction has 146 states and 147 transitions. [2025-01-10 07:07:27,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2025-01-10 07:07:27,739 INFO L432 stractBuchiCegarLoop]: Abstraction has 146 states and 147 transitions. [2025-01-10 07:07:27,739 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-01-10 07:07:27,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 146 states and 147 transitions. [2025-01-10 07:07:27,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:07:27,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:07:27,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:07:27,746 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [47, 46, 46, 1, 1, 1, 1] [2025-01-10 07:07:27,746 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:07:27,746 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#0(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(0, main_~i~0#1.base, main_~i~0#1.offset, 4);" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem5#1 < 100;havoc main_#t~mem5#1;" "call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" "call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume !(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;" "call write~int#1(5, main_~j~0#1.base, main_~j~0#1.offset, 4);" [2025-01-10 07:07:27,747 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume main_#t~mem9#1 < 21;havoc main_#t~mem9#1;" "call main_#t~mem10#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem10#1, main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem11#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(3 + main_#t~mem11#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem11#1;" [2025-01-10 07:07:27,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:07:27,748 INFO L85 PathProgramCache]: Analyzing trace with hash -2032775479, now seen corresponding path program 5 times [2025-01-10 07:07:27,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:07:27,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501171652] [2025-01-10 07:07:27,748 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:07:27,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:07:27,794 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 143 statements into 47 equivalence classes. [2025-01-10 07:07:28,056 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 143 of 143 statements. [2025-01-10 07:07:28,057 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-01-10 07:07:28,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:07:34,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:07:34,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:07:34,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501171652] [2025-01-10 07:07:34,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501171652] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:07:34,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476403383] [2025-01-10 07:07:34,767 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:07:34,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:07:34,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:07:34,769 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:07:34,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-01-10 07:07:34,872 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 143 statements into 47 equivalence classes.