./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/fermat-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/fermat-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e779827438904e8a0bb49f414cbe4d14072e556fff2389d3772808230457c73c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:54:08,226 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:54:08,281 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-09 06:54:08,286 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:54:08,286 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:54:08,286 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 06:54:08,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:54:08,304 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:54:08,304 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:54:08,304 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:54:08,305 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:54:08,306 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:54:08,306 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:54:08,306 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:54:08,307 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 06:54:08,307 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 06:54:08,307 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 06:54:08,307 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 06:54:08,307 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 06:54:08,307 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 06:54:08,307 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:54:08,308 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 06:54:08,308 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:54:08,308 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:54:08,308 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 06:54:08,308 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 06:54:08,308 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 06:54:08,308 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:54:08,308 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:54:08,308 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 06:54:08,309 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:54:08,309 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:54:08,309 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:54:08,309 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:54:08,309 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:54:08,309 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:54:08,310 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 06:54:08,310 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/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 -> e779827438904e8a0bb49f414cbe4d14072e556fff2389d3772808230457c73c [2025-03-09 06:54:08,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:54:08,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:54:08,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:54:08,539 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:54:08,539 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:54:08,540 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/fermat-alloca.i [2025-03-09 06:54:09,693 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a79075d0/1d86ad7bb13d4dafa425e088a78c5583/FLAG3d6416046 [2025-03-09 06:54:09,945 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:54:09,947 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/fermat-alloca.i [2025-03-09 06:54:09,957 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a79075d0/1d86ad7bb13d4dafa425e088a78c5583/FLAG3d6416046 [2025-03-09 06:54:10,270 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a79075d0/1d86ad7bb13d4dafa425e088a78c5583 [2025-03-09 06:54:10,272 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:54:10,273 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:54:10,275 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:54:10,275 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:54:10,279 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:54:10,279 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:54:10" (1/1) ... [2025-03-09 06:54:10,280 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48d4705a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:54:10, skipping insertion in model container [2025-03-09 06:54:10,280 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:54:10" (1/1) ... [2025-03-09 06:54:10,301 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:54:10,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:54:10,460 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:54:10,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:54:10,514 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:54:10,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:54:10 WrapperNode [2025-03-09 06:54:10,515 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:54:10,516 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:54:10,516 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:54:10,516 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:54:10,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:54:10" (1/1) ... [2025-03-09 06:54:10,526 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:54:10" (1/1) ... [2025-03-09 06:54:10,541 INFO L138 Inliner]: procedures = 109, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 112 [2025-03-09 06:54:10,541 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:54:10,542 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:54:10,542 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:54:10,542 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:54:10,546 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:54:10" (1/1) ... [2025-03-09 06:54:10,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:54:10" (1/1) ... [2025-03-09 06:54:10,548 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:54:10" (1/1) ... [2025-03-09 06:54:10,555 INFO L175 MemorySlicer]: Split 27 memory accesses to 4 slices as follows [8, 4, 7, 8]. 30 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0, 0]. The 9 writes are split as follows [3, 1, 2, 3]. [2025-03-09 06:54:10,555 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:54:10" (1/1) ... [2025-03-09 06:54:10,555 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:54:10" (1/1) ... [2025-03-09 06:54:10,558 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:54:10" (1/1) ... [2025-03-09 06:54:10,559 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:54:10" (1/1) ... [2025-03-09 06:54:10,560 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:54:10" (1/1) ... [2025-03-09 06:54:10,563 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:54:10" (1/1) ... [2025-03-09 06:54:10,565 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:54:10,565 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:54:10,565 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:54:10,565 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:54:10,566 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:54:10" (1/1) ... [2025-03-09 06:54:10,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:10,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:10,586 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:54:10,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-09 06:54:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:54:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 06:54:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 06:54:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 06:54:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:54:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 06:54:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 06:54:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 06:54:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 06:54:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 06:54:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:54:10,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:54:10,673 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:54:10,674 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:54:10,821 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L548: call ULTIMATE.dealloc(main_#t~malloc2#1.base, main_#t~malloc2#1.offset);havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call ULTIMATE.dealloc(main_#t~malloc3#1.base, main_#t~malloc3#1.offset);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call ULTIMATE.dealloc(main_#t~malloc4#1.base, main_#t~malloc4#1.offset);havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call ULTIMATE.dealloc(main_#t~malloc5#1.base, main_#t~malloc5#1.offset);havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset; [2025-03-09 06:54:10,830 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-09 06:54:10,831 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:54:10,838 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:54:10,841 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:54:10,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:54:10 BoogieIcfgContainer [2025-03-09 06:54:10,841 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:54:10,842 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 06:54:10,842 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 06:54:10,846 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 06:54:10,846 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:54:10,847 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 06:54:10" (1/3) ... [2025-03-09 06:54:10,848 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@acfe90c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:54:10, skipping insertion in model container [2025-03-09 06:54:10,848 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:54:10,848 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:54:10" (2/3) ... [2025-03-09 06:54:10,849 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@acfe90c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:54:10, skipping insertion in model container [2025-03-09 06:54:10,849 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:54:10,849 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:54:10" (3/3) ... [2025-03-09 06:54:10,850 INFO L363 chiAutomizerObserver]: Analyzing ICFG fermat-alloca.i [2025-03-09 06:54:10,887 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 06:54:10,888 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 06:54:10,888 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 06:54:10,888 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 06:54:10,888 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 06:54:10,888 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 06:54:10,888 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 06:54:10,889 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 06:54:10,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 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-03-09 06:54:10,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-09 06:54:10,904 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:54:10,904 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:54:10,907 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-09 06:54:10,907 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:54:10,908 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 06:54:10,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 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-03-09 06:54:10,909 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-09 06:54:10,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:54:10,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:54:10,911 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-09 06:54:10,911 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:54:10,914 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~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post24#1, main_#t~mem25#1, main_#t~mem26#1, main_~MAX~0#1.base, main_~MAX~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~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_~MAX~0#1.base, main_~MAX~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_~a~0#1.base, main_~a~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_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int#1(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#0(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#3(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#2(1, main_~c~0#1.base, main_~c~0#1.offset, 4);" [2025-03-09 06:54:10,915 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#0(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#3(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1;" "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume main_#t~mem21#1 > main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;call write~int#3(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#2(1 + main_#t~post24#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem23#1;havoc main_#t~post24#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" [2025-03-09 06:54:10,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:10,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1600, now seen corresponding path program 1 times [2025-03-09 06:54:10,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:10,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015179638] [2025-03-09 06:54:10,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:54:10,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:10,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:11,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:11,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:11,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:11,044 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:11,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:11,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:11,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:11,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:11,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:11,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:11,096 INFO L85 PathProgramCache]: Analyzing trace with hash 118080391, now seen corresponding path program 1 times [2025-03-09 06:54:11,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:11,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541219162] [2025-03-09 06:54:11,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:54:11,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:11,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:54:11,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:54:11,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:11,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 06:54:11,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [190845365] [2025-03-09 06:54:11,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:54:11,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:54:11,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:11,133 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:54:11,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 06:54:11,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:54:11,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:54:11,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:11,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:11,216 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:11,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:54:11,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:54:11,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:11,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:11,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:11,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:11,254 INFO L85 PathProgramCache]: Analyzing trace with hash -561969048, now seen corresponding path program 1 times [2025-03-09 06:54:11,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:11,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241874689] [2025-03-09 06:54:11,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:54:11,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:11,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:54:11,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:54:11,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:11,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:11,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:54:11,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:54:11,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241874689] [2025-03-09 06:54:11,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241874689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:54:11,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:54:11,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 06:54:11,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607324875] [2025-03-09 06:54:11,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:54:24,746 WARN L286 SmtUtils]: Spent 12.21s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 299] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-09 06:54:24,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:54:24,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:54:24,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:54:24,767 INFO L87 Difference]: Start difference. First operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 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) Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:54:24,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:54:24,875 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2025-03-09 06:54:24,876 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2025-03-09 06:54:24,876 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2025-03-09 06:54:24,880 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 23 states and 27 transitions. [2025-03-09 06:54:24,880 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-03-09 06:54:24,880 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-03-09 06:54:24,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2025-03-09 06:54:24,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:54:24,881 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-03-09 06:54:24,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2025-03-09 06:54:24,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-09 06:54:24,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 states have internal predecessors, (27), 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-03-09 06:54:24,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2025-03-09 06:54:24,896 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-03-09 06:54:24,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:54:24,899 INFO L432 stractBuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-03-09 06:54:24,899 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 06:54:24,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2025-03-09 06:54:24,900 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2025-03-09 06:54:24,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:54:24,900 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:54:24,900 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-09 06:54:24,900 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:54:24,900 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~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post24#1, main_#t~mem25#1, main_#t~mem26#1, main_~MAX~0#1.base, main_~MAX~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~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_~MAX~0#1.base, main_~MAX~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_~a~0#1.base, main_~a~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_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int#1(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#0(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#3(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#2(1, main_~c~0#1.base, main_~c~0#1.offset, 4);" [2025-03-09 06:54:24,900 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" [2025-03-09 06:54:24,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:24,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1600, now seen corresponding path program 2 times [2025-03-09 06:54:24,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:24,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347691737] [2025-03-09 06:54:24,901 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:54:24,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:24,908 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:24,925 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:24,925 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:54:24,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:24,925 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:24,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:24,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:24,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:24,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:24,940 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:24,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:24,943 INFO L85 PathProgramCache]: Analyzing trace with hash 119004873, now seen corresponding path program 1 times [2025-03-09 06:54:24,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:24,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140322089] [2025-03-09 06:54:24,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:54:24,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:24,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:54:24,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:54:24,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:24,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 06:54:24,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1240864650] [2025-03-09 06:54:24,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:54:24,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:54:24,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:24,958 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:54:24,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 06:54:24,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:54:25,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:54:25,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:25,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:25,007 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:25,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:54:25,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:54:25,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:25,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:25,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:25,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:25,020 INFO L85 PathProgramCache]: Analyzing trace with hash -561044566, now seen corresponding path program 1 times [2025-03-09 06:54:25,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:25,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863996777] [2025-03-09 06:54:25,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:54:25,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:25,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:54:25,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:54:25,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:25,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 06:54:25,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1087978850] [2025-03-09 06:54:25,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:54:25,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:54:25,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:25,048 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:54:25,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 06:54:25,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:54:25,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:54:25,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:25,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:25,119 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:25,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:54:25,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:54:25,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:25,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:25,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:38,259 WARN L286 SmtUtils]: Spent 13.12s on a formula simplification that was a NOOP. DAG size: 96 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-09 06:54:40,898 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:54:40,899 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:54:40,899 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:54:40,899 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:54:40,899 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:54:40,899 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:40,899 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:54:40,899 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:54:40,899 INFO L132 ssoRankerPreferences]: Filename of dumped script: fermat-alloca.i_Iteration2_Lasso [2025-03-09 06:54:40,899 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:54:40,899 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:54:40,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:40,937 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:40,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:40,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:40,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:40,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:40,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:40,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:40,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:40,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:40,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:40,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:40,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:40,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:40,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:40,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:40,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:41,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:41,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:41,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:41,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:41,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:41,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:41,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:41,978 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:41,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:42,838 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:54:42,841 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:54:42,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:42,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:42,844 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:54:42,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-09 06:54:42,847 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-03-09 06:54:42,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:42,858 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:42,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:42,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:42,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:42,865 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:42,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:42,867 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:42,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-03-09 06:54:42,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:42,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:42,878 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:54:42,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-09 06:54:42,880 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-03-09 06:54:42,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:42,893 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:42,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:42,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:42,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:42,893 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:42,893 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:42,895 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:42,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-03-09 06:54:42,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:42,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:42,905 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:54:42,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-09 06:54:42,906 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:54:42,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:42,916 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:42,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:42,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:42,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:42,917 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:42,917 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:42,919 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:42,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-03-09 06:54:42,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:42,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:42,930 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:54:42,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-09 06:54:42,933 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-03-09 06:54:42,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:42,944 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:42,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:42,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:42,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:42,945 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:42,945 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:42,946 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:42,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-03-09 06:54:42,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:42,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:42,955 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:54:42,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-09 06:54:42,958 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-03-09 06:54:42,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:42,968 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:42,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:42,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:42,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:42,969 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:42,969 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:42,970 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:42,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-09 06:54:42,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:42,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:42,979 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:54:42,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-09 06:54:42,983 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-03-09 06:54:42,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:42,995 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:42,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:42,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:42,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:42,996 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:42,996 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:42,999 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:43,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-03-09 06:54:43,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:43,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:43,009 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:54:43,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-09 06:54:43,011 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:54:43,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:43,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:43,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:43,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:43,024 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:43,024 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:43,027 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:43,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-09 06:54:43,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:43,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:43,036 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:54:43,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-09 06:54:43,041 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-03-09 06:54:43,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:43,051 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:43,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:43,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:43,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:43,052 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:43,052 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:43,053 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:43,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-03-09 06:54:43,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:43,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:43,061 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:54:43,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-09 06:54:43,063 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-03-09 06:54:43,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:43,075 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:43,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:43,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:43,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:43,075 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:43,075 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:43,076 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:43,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-09 06:54:43,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:43,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:43,084 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:54:43,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-09 06:54:43,085 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-03-09 06:54:43,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:43,095 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:43,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:43,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:43,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:43,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:43,096 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:43,097 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:43,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-09 06:54:43,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:43,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:43,106 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:54:43,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-09 06:54:43,108 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-03-09 06:54:43,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:43,118 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:43,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:43,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:43,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:43,118 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:43,118 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:43,119 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:43,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-03-09 06:54:43,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:43,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:43,127 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:54:43,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-09 06:54:43,130 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-03-09 06:54:43,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:43,140 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:43,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:43,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:43,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:43,140 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:43,140 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:43,141 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:43,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-09 06:54:43,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:43,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:43,149 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:54:43,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-09 06:54:43,150 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-03-09 06:54:43,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:43,160 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:43,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:43,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:43,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:43,160 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:43,160 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:43,161 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:43,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-09 06:54:43,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:43,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:43,169 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:54:43,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-09 06:54:43,171 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-03-09 06:54:43,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:43,181 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:43,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:43,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:43,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:43,182 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:43,182 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:43,183 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:43,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-03-09 06:54:43,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:43,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:43,190 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:54:43,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-09 06:54:43,192 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-03-09 06:54:43,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:43,203 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:43,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:43,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:43,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:43,204 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:43,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:43,205 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:43,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-03-09 06:54:43,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:43,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:43,213 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:54:43,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-09 06:54:43,214 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-03-09 06:54:43,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:43,224 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:43,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:43,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:43,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:43,225 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:43,225 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:43,226 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:43,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-09 06:54:43,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:43,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:43,233 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:54:43,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-09 06:54:43,235 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-03-09 06:54:43,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:43,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:43,246 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-09 06:54:43,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:43,256 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-03-09 06:54:43,256 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-03-09 06:54:43,272 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:54:43,324 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2025-03-09 06:54:43,327 INFO L444 ModelExtractionUtils]: 0 out of 26 variables were initially zero. Simplification set additionally 23 variables to zero. [2025-03-09 06:54:43,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:43,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:43,331 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:54:43,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-09 06:54:43,333 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:54:43,345 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2025-03-09 06:54:43,345 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:54:43,345 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~a~0#1.base) ULTIMATE.start_main_~a~0#1.offset)_1, v_rep(select (select #memory_int#1 ULTIMATE.start_main_~MAX~0#1.base) ULTIMATE.start_main_~MAX~0#1.offset)_1) = -1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~a~0#1.base) ULTIMATE.start_main_~a~0#1.offset)_1 + 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~MAX~0#1.base) ULTIMATE.start_main_~MAX~0#1.offset)_1 Supporting invariants [] [2025-03-09 06:54:43,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-03-09 06:54:43,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-03-09 06:54:43,570 INFO L156 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2025-03-09 06:54:43,575 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-09 06:54:43,575 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-09 06:54:43,576 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~MAX~0!base,]]] [2025-03-09 06:54:43,576 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 06:54:43,576 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 06:54:43,576 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~a~0!base,]]] [2025-03-09 06:54:43,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:43,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:43,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:43,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:43,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:43,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:54:43,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:43,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:54:43,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:54:43,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:43,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:43,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:54:43,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:43,713 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 42 treesize of output 19 [2025-03-09 06:54:43,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:54:43,851 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-03-09 06:54:43,852 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 7 Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:54:43,936 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 7. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 36 transitions. Complement of second has 7 states. [2025-03-09 06:54:43,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-09 06:54:43,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:54:43,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2025-03-09 06:54:43,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 7 letters. [2025-03-09 06:54:43,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:43,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 9 letters. Loop has 7 letters. [2025-03-09 06:54:43,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:43,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 14 letters. [2025-03-09 06:54:43,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:43,942 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. [2025-03-09 06:54:43,943 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2025-03-09 06:54:43,943 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 36 transitions. [2025-03-09 06:54:43,943 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2025-03-09 06:54:43,944 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-03-09 06:54:43,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 36 transitions. [2025-03-09 06:54:43,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:54:43,944 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 36 transitions. [2025-03-09 06:54:43,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 36 transitions. [2025-03-09 06:54:43,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2025-03-09 06:54:43,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:54:43,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2025-03-09 06:54:43,946 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 35 transitions. [2025-03-09 06:54:43,946 INFO L432 stractBuchiCegarLoop]: Abstraction has 30 states and 35 transitions. [2025-03-09 06:54:43,946 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-09 06:54:43,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 35 transitions. [2025-03-09 06:54:43,946 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2025-03-09 06:54:43,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:54:43,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:54:43,946 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-09 06:54:43,946 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:54:43,946 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~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post24#1, main_#t~mem25#1, main_#t~mem26#1, main_~MAX~0#1.base, main_~MAX~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~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_~MAX~0#1.base, main_~MAX~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_~a~0#1.base, main_~a~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_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int#1(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#0(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#3(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#2(1, main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#0(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#3(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1;" [2025-03-09 06:54:43,947 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" [2025-03-09 06:54:43,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:43,947 INFO L85 PathProgramCache]: Analyzing trace with hash 47682443, now seen corresponding path program 1 times [2025-03-09 06:54:43,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:43,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826152392] [2025-03-09 06:54:43,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:54:43,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:43,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:54:43,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:54:43,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:43,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:44,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:54:44,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:54:44,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826152392] [2025-03-09 06:54:44,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826152392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:54:44,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:54:44,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:54:44,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984974326] [2025-03-09 06:54:44,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:54:44,131 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:54:44,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:44,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1375149005, now seen corresponding path program 2 times [2025-03-09 06:54:44,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:44,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068261606] [2025-03-09 06:54:44,132 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:54:44,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:44,136 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:54:44,139 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:54:44,139 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:54:44,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 06:54:44,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2013887822] [2025-03-09 06:54:44,140 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:54:44,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:54:44,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:44,145 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:54:44,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-09 06:54:44,179 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:54:44,186 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:54:44,186 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:54:44,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:44,186 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:44,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:54:44,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:54:44,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:44,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:44,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:45,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:54:45,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:54:45,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:54:45,125 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. cyclomatic complexity: 8 Second operand has 4 states, 3 states have (on average 1.6666666666666667) 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-03-09 06:54:45,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:54:45,178 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2025-03-09 06:54:45,178 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 38 transitions. [2025-03-09 06:54:45,180 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2025-03-09 06:54:45,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 32 states and 36 transitions. [2025-03-09 06:54:45,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-03-09 06:54:45,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-03-09 06:54:45,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 36 transitions. [2025-03-09 06:54:45,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:54:45,180 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 36 transitions. [2025-03-09 06:54:45,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 36 transitions. [2025-03-09 06:54:45,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2025-03-09 06:54:45,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 29 states have internal predecessors, (34), 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-03-09 06:54:45,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2025-03-09 06:54:45,182 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 34 transitions. [2025-03-09 06:54:45,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:54:45,184 INFO L432 stractBuchiCegarLoop]: Abstraction has 30 states and 34 transitions. [2025-03-09 06:54:45,184 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-09 06:54:45,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 34 transitions. [2025-03-09 06:54:45,184 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2025-03-09 06:54:45,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:54:45,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:54:45,185 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:54:45,185 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:54:45,185 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~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post24#1, main_#t~mem25#1, main_#t~mem26#1, main_~MAX~0#1.base, main_~MAX~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~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_~MAX~0#1.base, main_~MAX~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_~a~0#1.base, main_~a~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_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int#1(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#0(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#3(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#2(1, main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#0(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#3(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1;" [2025-03-09 06:54:45,185 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" [2025-03-09 06:54:45,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:45,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1934067169, now seen corresponding path program 1 times [2025-03-09 06:54:45,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:45,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843189754] [2025-03-09 06:54:45,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:54:45,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:45,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:54:45,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:54:45,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:45,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:45,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:54:45,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:54:45,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843189754] [2025-03-09 06:54:45,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843189754] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:54:45,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011597085] [2025-03-09 06:54:45,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:54:45,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:54:45,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:45,513 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:54:45,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-09 06:54:45,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:54:45,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:54:45,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:45,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:45,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 06:54:45,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:45,586 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-03-09 06:54:45,597 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-03-09 06:54:45,626 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-03-09 06:54:45,748 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 17 treesize of output 9 [2025-03-09 06:54:45,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:54:45,781 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:54:45,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:54:45,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011597085] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:54:45,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:54:45,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2025-03-09 06:54:45,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515414845] [2025-03-09 06:54:45,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:54:45,882 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:54:45,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:45,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1375149005, now seen corresponding path program 3 times [2025-03-09 06:54:45,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:45,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342137267] [2025-03-09 06:54:45,883 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:54:45,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:45,890 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:54:45,898 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:54:45,901 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 06:54:45,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 06:54:45,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [151460879] [2025-03-09 06:54:45,901 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:54:45,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:54:45,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:45,903 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:54:45,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-09 06:54:45,942 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:54:45,949 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:54:45,949 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 06:54:45,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:45,949 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:45,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:54:45,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:54:45,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:45,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:45,971 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:58,363 WARN L286 SmtUtils]: Spent 12.39s on a formula simplification that was a NOOP. DAG size: 96 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-09 06:54:58,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:54:58,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 06:54:58,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-09 06:54:58,641 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. cyclomatic complexity: 7 Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 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-03-09 06:54:58,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:54:58,810 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2025-03-09 06:54:58,810 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 75 transitions. [2025-03-09 06:54:58,811 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2025-03-09 06:54:58,811 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 53 states and 57 transitions. [2025-03-09 06:54:58,812 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-03-09 06:54:58,812 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-03-09 06:54:58,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 57 transitions. [2025-03-09 06:54:58,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:54:58,812 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 57 transitions. [2025-03-09 06:54:58,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 57 transitions. [2025-03-09 06:54:58,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2025-03-09 06:54:58,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 46 states have internal predecessors, (51), 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-03-09 06:54:58,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2025-03-09 06:54:58,814 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 51 transitions. [2025-03-09 06:54:58,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 06:54:58,815 INFO L432 stractBuchiCegarLoop]: Abstraction has 47 states and 51 transitions. [2025-03-09 06:54:58,815 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-09 06:54:58,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 51 transitions. [2025-03-09 06:54:58,816 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2025-03-09 06:54:58,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:54:58,816 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:54:58,817 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1] [2025-03-09 06:54:58,817 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:54:58,817 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~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post24#1, main_#t~mem25#1, main_#t~mem26#1, main_~MAX~0#1.base, main_~MAX~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~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_~MAX~0#1.base, main_~MAX~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_~a~0#1.base, main_~a~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_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int#1(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#0(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#3(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#2(1, main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#0(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#3(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1;" [2025-03-09 06:54:58,818 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" [2025-03-09 06:54:58,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:58,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1822853643, now seen corresponding path program 2 times [2025-03-09 06:54:58,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:58,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708350996] [2025-03-09 06:54:58,818 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:54:58,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:58,830 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-09 06:54:58,845 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 06:54:58,846 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:54:58,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:59,515 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:54:59,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:54:59,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708350996] [2025-03-09 06:54:59,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708350996] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:54:59,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667497555] [2025-03-09 06:54:59,515 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:54:59,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:54:59,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:59,517 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:54:59,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-09 06:54:59,573 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-09 06:54:59,622 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 06:54:59,623 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:54:59,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:59,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 06:54:59,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:59,636 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-03-09 06:54:59,651 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-03-09 06:54:59,676 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-03-09 06:54:59,781 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-03-09 06:54:59,862 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-03-09 06:54:59,956 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-03-09 06:55:00,073 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 17 treesize of output 9 [2025-03-09 06:55:00,108 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:55:00,108 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:55:00,602 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:55:00,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667497555] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:55:00,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:55:00,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2025-03-09 06:55:00,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273613344] [2025-03-09 06:55:00,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:55:00,603 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:55:00,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:00,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1375149005, now seen corresponding path program 4 times [2025-03-09 06:55:00,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:00,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931406440] [2025-03-09 06:55:00,603 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:55:00,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:00,608 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 7 statements into 2 equivalence classes. [2025-03-09 06:55:00,610 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:55:00,610 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:55:00,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 06:55:00,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1024703791] [2025-03-09 06:55:00,611 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:55:00,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:55:00,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:00,613 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:55:00,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-09 06:55:00,666 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 7 statements into 2 equivalence classes. [2025-03-09 06:55:00,693 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:55:00,694 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:55:00,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:00,694 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:00,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:55:00,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:55:00,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:00,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:00,717 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:55:01,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:55:01,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 06:55:01,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2025-03-09 06:55:01,540 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. cyclomatic complexity: 7 Second operand has 16 states, 15 states have (on average 4.6) internal successors, (69), 16 states have internal predecessors, (69), 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-03-09 06:55:02,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:55:02,121 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2025-03-09 06:55:02,122 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 135 transitions. [2025-03-09 06:55:02,123 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2025-03-09 06:55:02,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 95 states and 99 transitions. [2025-03-09 06:55:02,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-03-09 06:55:02,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-03-09 06:55:02,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 99 transitions. [2025-03-09 06:55:02,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:55:02,124 INFO L218 hiAutomatonCegarLoop]: Abstraction has 95 states and 99 transitions. [2025-03-09 06:55:02,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 99 transitions. [2025-03-09 06:55:02,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89. [2025-03-09 06:55:02,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.0449438202247192) internal successors, (93), 88 states have internal predecessors, (93), 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-03-09 06:55:02,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2025-03-09 06:55:02,127 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 93 transitions. [2025-03-09 06:55:02,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-09 06:55:02,128 INFO L432 stractBuchiCegarLoop]: Abstraction has 89 states and 93 transitions. [2025-03-09 06:55:02,128 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-09 06:55:02,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 93 transitions. [2025-03-09 06:55:02,129 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2025-03-09 06:55:02,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:55:02,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:55:02,130 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 10, 10, 10, 10, 10, 1, 1, 1] [2025-03-09 06:55:02,130 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:55:02,130 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~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post24#1, main_#t~mem25#1, main_#t~mem26#1, main_~MAX~0#1.base, main_~MAX~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~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_~MAX~0#1.base, main_~MAX~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_~a~0#1.base, main_~a~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_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int#1(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#0(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#3(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#2(1, main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#0(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#3(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1;" [2025-03-09 06:55:02,131 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" [2025-03-09 06:55:02,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:02,132 INFO L85 PathProgramCache]: Analyzing trace with hash -224865333, now seen corresponding path program 3 times [2025-03-09 06:55:02,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:02,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154367976] [2025-03-09 06:55:02,132 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:55:02,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:02,156 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 75 statements into 11 equivalence classes. [2025-03-09 06:55:02,220 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 75 of 75 statements. [2025-03-09 06:55:02,220 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-09 06:55:02,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:03,983 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:55:03,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:55:03,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154367976] [2025-03-09 06:55:03,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154367976] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:55:03,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904731264] [2025-03-09 06:55:03,984 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:55:03,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:55:03,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:03,986 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:55:03,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-09 06:55:04,050 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 75 statements into 11 equivalence classes. [2025-03-09 06:55:04,767 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 75 of 75 statements. [2025-03-09 06:55:04,767 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-09 06:55:04,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:04,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 899 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-09 06:55:04,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:55:04,785 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-03-09 06:55:04,792 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-03-09 06:55:04,819 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-03-09 06:55:04,901 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-03-09 06:55:04,964 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-03-09 06:55:05,035 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-03-09 06:55:05,104 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-03-09 06:55:05,162 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-03-09 06:55:05,232 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-03-09 06:55:05,312 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-03-09 06:55:05,388 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-03-09 06:55:05,473 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-03-09 06:55:05,568 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 17 treesize of output 9 [2025-03-09 06:55:05,615 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:55:05,615 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:55:06,616 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:55:06,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904731264] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:55:06,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:55:06,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 27 [2025-03-09 06:55:06,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335846483] [2025-03-09 06:55:06,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:55:06,617 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:55:06,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:06,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1375149005, now seen corresponding path program 5 times [2025-03-09 06:55:06,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:06,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24258756] [2025-03-09 06:55:06,617 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:55:06,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:06,624 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:55:06,630 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:55:06,630 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:55:06,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 06:55:06,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1410533662] [2025-03-09 06:55:06,631 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:55:06,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:55:06,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:06,634 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:55:06,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-09 06:55:06,676 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:55:06,696 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:55:06,696 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:55:06,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:06,696 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:06,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:55:06,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:55:06,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:06,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:06,706 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:55:19,368 WARN L286 SmtUtils]: Spent 12.03s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-09 06:55:19,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:55:19,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-09 06:55:19,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=448, Unknown=0, NotChecked=0, Total=756 [2025-03-09 06:55:19,582 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. cyclomatic complexity: 7 Second operand has 28 states, 27 states have (on average 5.666666666666667) internal successors, (153), 28 states have internal predecessors, (153), 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-03-09 06:55:21,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:55:21,059 INFO L93 Difference]: Finished difference Result 251 states and 255 transitions. [2025-03-09 06:55:21,059 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 251 states and 255 transitions. [2025-03-09 06:55:21,061 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2025-03-09 06:55:21,065 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 251 states to 179 states and 183 transitions. [2025-03-09 06:55:21,065 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-03-09 06:55:21,065 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-03-09 06:55:21,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 179 states and 183 transitions. [2025-03-09 06:55:21,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:55:21,066 INFO L218 hiAutomatonCegarLoop]: Abstraction has 179 states and 183 transitions. [2025-03-09 06:55:21,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states and 183 transitions. [2025-03-09 06:55:21,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 173. [2025-03-09 06:55:21,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 173 states have (on average 1.023121387283237) internal successors, (177), 172 states have internal predecessors, (177), 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-03-09 06:55:21,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 177 transitions. [2025-03-09 06:55:21,076 INFO L240 hiAutomatonCegarLoop]: Abstraction has 173 states and 177 transitions. [2025-03-09 06:55:21,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-09 06:55:21,077 INFO L432 stractBuchiCegarLoop]: Abstraction has 173 states and 177 transitions. [2025-03-09 06:55:21,077 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-09 06:55:21,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 173 states and 177 transitions. [2025-03-09 06:55:21,079 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2025-03-09 06:55:21,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:55:21,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:55:21,082 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [23, 23, 22, 22, 22, 22, 22, 1, 1, 1] [2025-03-09 06:55:21,082 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:55:21,082 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~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post24#1, main_#t~mem25#1, main_#t~mem26#1, main_~MAX~0#1.base, main_~MAX~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~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_~MAX~0#1.base, main_~MAX~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_~a~0#1.base, main_~a~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_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int#1(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#0(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#3(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#2(1, main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#0(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#3(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1;" [2025-03-09 06:55:21,083 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem21#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1;" "call main_#t~mem25#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#3(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#0(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#0(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#1(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);" "assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1;" [2025-03-09 06:55:21,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:21,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1764808523, now seen corresponding path program 4 times [2025-03-09 06:55:21,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:21,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536229279] [2025-03-09 06:55:21,084 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:55:21,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:21,119 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 159 statements into 2 equivalence classes. [2025-03-09 06:55:21,185 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 159 of 159 statements. [2025-03-09 06:55:21,186 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:55:21,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:25,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 0 proven. 1683 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:55:25,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:55:25,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536229279] [2025-03-09 06:55:25,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536229279] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:55:25,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625505099] [2025-03-09 06:55:25,707 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:55:25,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:55:25,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:25,709 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:55:25,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-03-09 06:55:25,803 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 159 statements into 2 equivalence classes. [2025-03-09 06:55:34,545 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 159 of 159 statements. [2025-03-09 06:55:34,546 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:55:34,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:34,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 1787 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-03-09 06:55:34,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:55:34,578 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-03-09 06:55:34,588 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-03-09 06:55:34,625 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-03-09 06:55:34,716 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-03-09 06:55:34,790 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-03-09 06:55:34,866 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-03-09 06:55:34,941 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-03-09 06:55:35,027 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-03-09 06:55:35,113 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-03-09 06:55:35,201 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-03-09 06:55:35,309 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-03-09 06:55:35,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-03-09 06:55:35,523 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-03-09 06:55:35,608 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-03-09 06:55:35,705 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-03-09 06:55:35,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-03-09 06:55:35,901 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-03-09 06:55:35,998 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-03-09 06:55:36,094 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-03-09 06:55:36,197 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-03-09 06:55:36,298 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-03-09 06:55:36,410 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-03-09 06:55:36,534 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-03-09 06:55:36,673 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-03-09 06:55:36,802 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 17 treesize of output 9 [2025-03-09 06:55:36,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 0 proven. 1683 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:55:36,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:55:39,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 0 proven. 1683 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:55:39,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625505099] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:55:39,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:55:39,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 25, 25] total 77 [2025-03-09 06:55:39,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326931813] [2025-03-09 06:55:39,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:55:39,687 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:55:39,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:39,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1375149005, now seen corresponding path program 6 times [2025-03-09 06:55:39,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:39,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976069738] [2025-03-09 06:55:39,687 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:55:39,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:39,690 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:55:39,692 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:55:39,692 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-09 06:55:39,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 06:55:39,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1587925555] [2025-03-09 06:55:39,692 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:55:39,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:55:39,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:39,694 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:55:39,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-03-09 06:55:39,742 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:55:39,749 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:55:39,749 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-09 06:55:39,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:39,749 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:39,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:55:39,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:55:39,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:39,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:39,779 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace