./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 8fc3dc66 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-?-8fc3dc6-m [2025-03-17 19:56:52,035 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:56:52,084 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-17 19:56:52,089 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:56:52,090 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:56:52,090 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 19:56:52,111 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:56:52,112 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:56:52,112 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:56:52,112 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:56:52,112 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:56:52,113 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:56:52,113 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:56:52,113 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:56:52,113 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 19:56:52,113 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 19:56:52,114 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 19:56:52,114 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 19:56:52,114 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 19:56:52,114 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 19:56:52,114 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:56:52,114 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 19:56:52,114 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:56:52,114 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:56:52,115 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 19:56:52,115 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 19:56:52,115 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 19:56:52,115 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:56:52,115 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:56:52,115 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 19:56:52,115 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:56:52,115 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:56:52,115 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:56:52,115 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:56:52,115 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:56:52,116 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:56:52,116 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 19:56:52,116 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-17 19:56:52,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:56:52,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:56:52,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:56:52,363 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:56:52,363 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:56:52,364 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-17 19:56:53,585 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbe6d4c51/2d966e6b90654336b3079fb6405f286b/FLAG29683c03f [2025-03-17 19:56:53,855 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:56:53,856 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/fermat-alloca.i [2025-03-17 19:56:53,866 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbe6d4c51/2d966e6b90654336b3079fb6405f286b/FLAG29683c03f [2025-03-17 19:56:53,877 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbe6d4c51/2d966e6b90654336b3079fb6405f286b [2025-03-17 19:56:53,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:56:53,880 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:56:53,881 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:56:53,881 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:56:53,884 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:56:53,885 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:56:53" (1/1) ... [2025-03-17 19:56:53,886 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ed78ba6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:56:53, skipping insertion in model container [2025-03-17 19:56:53,886 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:56:53" (1/1) ... [2025-03-17 19:56:53,909 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:56:54,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:56:54,077 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:56:54,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:56:54,130 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:56:54,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:56:54 WrapperNode [2025-03-17 19:56:54,131 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:56:54,131 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:56:54,131 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:56:54,131 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:56:54,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:56:54" (1/1) ... [2025-03-17 19:56:54,141 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:56:54" (1/1) ... [2025-03-17 19:56:54,154 INFO L138 Inliner]: procedures = 109, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 112 [2025-03-17 19:56:54,155 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:56:54,155 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:56:54,155 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:56:54,155 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:56:54,160 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:56:54" (1/1) ... [2025-03-17 19:56:54,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:56:54" (1/1) ... [2025-03-17 19:56:54,162 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:56:54" (1/1) ... [2025-03-17 19:56:54,172 INFO L175 MemorySlicer]: Split 27 memory accesses to 4 slices as follows [7, 4, 8, 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 [2, 1, 3, 3]. [2025-03-17 19:56:54,172 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:56:54" (1/1) ... [2025-03-17 19:56:54,172 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:56:54" (1/1) ... [2025-03-17 19:56:54,175 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:56:54" (1/1) ... [2025-03-17 19:56:54,176 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:56:54" (1/1) ... [2025-03-17 19:56:54,176 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:56:54" (1/1) ... [2025-03-17 19:56:54,177 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:56:54" (1/1) ... [2025-03-17 19:56:54,178 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:56:54,179 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:56:54,179 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:56:54,179 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:56:54,180 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:56:54" (1/1) ... [2025-03-17 19:56:54,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:56:54,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:54,207 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-17 19:56:54,212 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-17 19:56:54,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 19:56:54,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 19:56:54,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 19:56:54,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 19:56:54,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 19:56:54,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 19:56:54,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 19:56:54,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 19:56:54,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 19:56:54,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 19:56:54,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:56:54,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:56:54,296 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:56:54,298 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:56:54,429 INFO L1322 $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-17 19:56:54,435 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-17 19:56:54,435 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:56:54,443 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:56:54,443 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 19:56:54,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:56:54 BoogieIcfgContainer [2025-03-17 19:56:54,443 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:56:54,444 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 19:56:54,444 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 19:56:54,448 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 19:56:54,448 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:56:54,448 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 07:56:53" (1/3) ... [2025-03-17 19:56:54,449 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d59ac6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:56:54, skipping insertion in model container [2025-03-17 19:56:54,449 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:56:54,449 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:56:54" (2/3) ... [2025-03-17 19:56:54,449 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d59ac6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:56:54, skipping insertion in model container [2025-03-17 19:56:54,449 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:56:54,449 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:56:54" (3/3) ... [2025-03-17 19:56:54,450 INFO L363 chiAutomizerObserver]: Analyzing ICFG fermat-alloca.i [2025-03-17 19:56:54,490 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 19:56:54,490 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 19:56:54,490 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 19:56:54,491 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 19:56:54,491 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 19:56:54,491 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 19:56:54,491 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 19:56:54,491 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 19:56:54,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:56:54,507 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-17 19:56:54,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:56:54,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:56:54,513 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:56:54,514 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:56:54,514 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 19:56:54,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:56:54,514 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-17 19:56:54,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:56:54,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:56:54,515 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:56:54,515 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:56:54,520 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#2(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#0(1, main_~c~0#1.base, main_~c~0#1.offset, 4);" [2025-03-17 19:56:54,520 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#0(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#0(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-17 19:56:54,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:54,527 INFO L85 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 1 times [2025-03-17 19:56:54,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:54,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003010639] [2025-03-17 19:56:54,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:56:54,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:54,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:56:54,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:56:54,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:54,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:54,693 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:54,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:56:54,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:56:54,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:54,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:54,751 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:54,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:54,753 INFO L85 PathProgramCache]: Analyzing trace with hash 118080391, now seen corresponding path program 1 times [2025-03-17 19:56:54,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:54,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067480043] [2025-03-17 19:56:54,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:56:54,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:54,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:56:54,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:56:54,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:54,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 19:56:54,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [834088776] [2025-03-17 19:56:54,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:56:54,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:56:54,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:56:54,796 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-17 19:56:54,798 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-17 19:56:54,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:56:54,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:56:54,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:54,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:54,884 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:56:54,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:56:54,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:56:54,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:54,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:56:54,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:56:54,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:56:54,931 INFO L85 PathProgramCache]: Analyzing trace with hash -383559114, now seen corresponding path program 1 times [2025-03-17 19:56:54,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:56:54,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742741756] [2025-03-17 19:56:54,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:56:54,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:56:54,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 19:56:54,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 19:56:54,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:56:54,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:56:55,365 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-17 19:56:55,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:56:55,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742741756] [2025-03-17 19:56:55,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742741756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:56:55,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:56:55,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:56:55,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856937990] [2025-03-17 19:56:55,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:57:08,025 WARN L286 SmtUtils]: Spent 12.65s on a formula simplification that was a NOOP. DAG size: 118 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-17 19:57:20,294 WARN L286 SmtUtils]: Spent 12.05s 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-17 19:57:32,592 WARN L286 SmtUtils]: Spent 12.30s 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-17 19:57:32,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:57:32,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:57:32,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:57:32,615 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:57:32,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:57:32,673 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2025-03-17 19:57:32,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2025-03-17 19:57:32,675 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-17 19:57:32,680 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 11 states and 13 transitions. [2025-03-17 19:57:32,681 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-17 19:57:32,681 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-17 19:57:32,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2025-03-17 19:57:32,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:57:32,682 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-03-17 19:57:32,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2025-03-17 19:57:32,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-03-17 19:57:32,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:57:32,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2025-03-17 19:57:32,700 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-03-17 19:57:32,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:57:32,704 INFO L432 stractBuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-03-17 19:57:32,706 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 19:57:32,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2025-03-17 19:57:32,706 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-17 19:57:32,707 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:57:32,707 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:57:32,707 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 19:57:32,707 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:57:32,708 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#2(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#0(1, main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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-17 19:57:32,708 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 write~int#3(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#0(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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#2(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-17 19:57:32,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:32,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1506394, now seen corresponding path program 1 times [2025-03-17 19:57:32,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:32,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410361898] [2025-03-17 19:57:32,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:32,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:32,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:57:32,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:57:32,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:32,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 19:57:32,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1973616255] [2025-03-17 19:57:32,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:32,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:57:32,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:32,761 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-17 19:57:32,763 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-17 19:57:32,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:57:32,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:57:32,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:32,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:32,824 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:32,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:57:32,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:57:32,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:32,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:32,843 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:32,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:32,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1346519853, now seen corresponding path program 2 times [2025-03-17 19:57:32,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:32,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077864582] [2025-03-17 19:57:32,844 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:57:32,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:32,850 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:57:32,854 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:57:32,854 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:57:32,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 19:57:32,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [394070462] [2025-03-17 19:57:32,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:57:32,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:57:32,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:32,857 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-17 19:57:32,859 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-17 19:57:32,899 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:57:32,922 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:57:32,922 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:57:32,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:32,923 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:32,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:57:32,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:57:32,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:32,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:32,946 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:32,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:32,947 INFO L85 PathProgramCache]: Analyzing trace with hash -253730636, now seen corresponding path program 1 times [2025-03-17 19:57:32,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:32,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140754239] [2025-03-17 19:57:32,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:32,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:32,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 19:57:32,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:57:32,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:32,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:33,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:57:33,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:57:33,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140754239] [2025-03-17 19:57:33,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140754239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:57:33,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:57:33,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 19:57:33,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926160674] [2025-03-17 19:57:33,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:57:34,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:57:34,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:57:34,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:57:34,196 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. cyclomatic complexity: 3 Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:57:34,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:57:34,275 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2025-03-17 19:57:34,275 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2025-03-17 19:57:34,275 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2025-03-17 19:57:34,275 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 21 transitions. [2025-03-17 19:57:34,275 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2025-03-17 19:57:34,276 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2025-03-17 19:57:34,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2025-03-17 19:57:34,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:57:34,276 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 21 transitions. [2025-03-17 19:57:34,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2025-03-17 19:57:34,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-17 19:57:34,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:57:34,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2025-03-17 19:57:34,277 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 21 transitions. [2025-03-17 19:57:34,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:57:34,278 INFO L432 stractBuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2025-03-17 19:57:34,278 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 19:57:34,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2025-03-17 19:57:34,278 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2025-03-17 19:57:34,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:57:34,279 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:57:34,279 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 19:57:34,279 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:57:34,279 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#2(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#0(1, main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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-17 19:57:34,279 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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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-17 19:57:34,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:34,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1506394, now seen corresponding path program 2 times [2025-03-17 19:57:34,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:34,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680197192] [2025-03-17 19:57:34,280 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:57:34,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:34,289 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:57:34,298 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:57:34,299 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:57:34,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 19:57:34,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [363002943] [2025-03-17 19:57:34,300 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:57:34,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:57:34,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:34,302 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:57:34,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 19:57:34,344 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:57:34,369 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:57:34,369 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:57:34,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:34,369 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:34,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:57:34,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:57:34,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:34,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:34,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:34,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:34,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1375149005, now seen corresponding path program 1 times [2025-03-17 19:57:34,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:34,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832816199] [2025-03-17 19:57:34,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:34,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:34,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:57:34,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:57:34,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:34,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 19:57:34,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [297687224] [2025-03-17 19:57:34,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:34,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:57:34,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:34,398 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:57:34,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 19:57:34,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:57:34,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:57:34,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:34,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:34,446 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:34,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:57:34,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:57:34,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:34,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:34,470 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:34,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:34,470 INFO L85 PathProgramCache]: Analyzing trace with hash -225101484, now seen corresponding path program 1 times [2025-03-17 19:57:34,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:34,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165543889] [2025-03-17 19:57:34,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:34,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:34,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 19:57:34,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:57:34,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:34,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 19:57:34,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [625615602] [2025-03-17 19:57:34,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:34,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:57:34,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:34,519 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:57:34,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 19:57:34,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 19:57:34,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:57:34,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:34,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:34,617 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:34,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 19:57:34,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:57:34,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:34,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:34,646 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:47,308 WARN L286 SmtUtils]: Spent 12.24s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 299] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-17 19:57:49,176 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:57:49,177 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:57:49,177 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:57:49,177 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:57:49,177 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:57:49,177 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:49,177 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:57:49,177 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:57:49,177 INFO L132 ssoRankerPreferences]: Filename of dumped script: fermat-alloca.i_Iteration3_Lasso [2025-03-17 19:57:49,177 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:57:49,177 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:57:49,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:49,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:49,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:49,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:49,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:49,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:49,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:49,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:49,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:49,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:49,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:49,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:49,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:49,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:49,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:49,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:49,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:49,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:02,334 WARN L286 SmtUtils]: Spent 12.33s on a formula simplification. DAG size of input: 79 DAG size of output: 78 (called from [L 270] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.setFormulaAndSimplify) [2025-03-17 19:58:02,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:02,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:02,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:02,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:02,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:02,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:02,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:02,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:58:14,633 WARN L286 SmtUtils]: Spent 12.12s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2025-03-17 19:58:15,060 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:58:15,063 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:58:15,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:15,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:15,066 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-17 19:58:15,067 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-17 19:58:15,069 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-17 19:58:15,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:15,080 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:15,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:15,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:15,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:15,084 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:15,084 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:15,086 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:15,092 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-17 19:58:15,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:15,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:15,094 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-17 19:58:15,096 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-17 19:58:15,097 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-17 19:58:15,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:15,107 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:15,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:15,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:15,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:15,108 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:15,108 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:15,109 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:15,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-17 19:58:15,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:15,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:15,118 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-17 19:58:15,119 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-17 19:58:15,120 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-17 19:58:15,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:15,130 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:15,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:15,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:15,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:15,131 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:15,131 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:15,132 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:15,138 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-17 19:58:15,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:15,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:15,140 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-17 19:58:15,142 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-17 19:58:15,143 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-17 19:58:15,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:15,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:15,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:15,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:15,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:15,154 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:15,154 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:15,155 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:15,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-03-17 19:58:15,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:15,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:15,163 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-17 19:58:15,164 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-17 19:58:15,166 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-17 19:58:15,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:15,175 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:15,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:15,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:15,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:15,176 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:15,176 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:15,178 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:15,183 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-17 19:58:15,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:15,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:15,185 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-17 19:58:15,186 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-17 19:58:15,188 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-17 19:58:15,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:15,198 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:15,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:15,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:15,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:15,199 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:15,199 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:15,200 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:15,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-03-17 19:58:15,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:15,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:15,208 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-17 19:58:15,210 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-17 19:58:15,211 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-17 19:58:15,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:15,221 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:15,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:15,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:15,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:15,221 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:15,221 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:15,222 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:15,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-03-17 19:58:15,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:15,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:15,230 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-17 19:58:15,232 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-17 19:58:15,233 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-17 19:58:15,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:15,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:15,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:15,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:15,245 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:58:15,245 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:58:15,248 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:15,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-03-17 19:58:15,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:15,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:15,257 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-17 19:58:15,258 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-17 19:58:15,259 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-17 19:58:15,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:15,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:15,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:15,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:15,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:15,270 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:15,270 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:15,272 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:15,278 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-17 19:58:15,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:15,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:15,280 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-17 19:58:15,281 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-17 19:58:15,282 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-17 19:58:15,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:15,292 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:15,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:15,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:15,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:15,292 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:15,292 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:15,293 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:15,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-03-17 19:58:15,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:15,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:15,301 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-17 19:58:15,301 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-17 19:58:15,302 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-17 19:58:15,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:15,312 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:15,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:15,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:15,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:15,312 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:15,312 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:15,313 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:15,318 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-17 19:58:15,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:15,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:15,321 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-17 19:58:15,321 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-17 19:58:15,322 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-17 19:58:15,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:15,332 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:15,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:15,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:15,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:15,332 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:15,332 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:15,333 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:15,338 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-17 19:58:15,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:15,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:15,340 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-17 19:58:15,341 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-17 19:58:15,342 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-17 19:58:15,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:15,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:15,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:15,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:15,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:15,352 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:15,352 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:15,353 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:15,359 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-17 19:58:15,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:15,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:15,361 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-17 19:58:15,361 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-17 19:58:15,362 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-17 19:58:15,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:15,371 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:15,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:15,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:15,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:15,372 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:15,372 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:15,373 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:15,377 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-17 19:58:15,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:15,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:15,379 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-17 19:58:15,380 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-17 19:58:15,380 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-17 19:58:15,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:15,389 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:15,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:15,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:15,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:15,390 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:15,390 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:15,391 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:15,396 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-17 19:58:15,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:15,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:15,398 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:15,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-17 19:58:15,399 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-17 19:58:15,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:15,409 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:15,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:15,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:15,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:15,409 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:15,409 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:15,410 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:15,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-17 19:58:15,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:15,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:15,417 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:15,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-17 19:58:15,419 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-17 19:58:15,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:15,428 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:58:15,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:15,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:15,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:15,428 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:58:15,428 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:58:15,429 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:15,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-03-17 19:58:15,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:15,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:15,436 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:15,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-17 19:58:15,438 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-17 19:58:15,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:15,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:15,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:15,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:15,450 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:58:15,450 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:58:15,452 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:15,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-03-17 19:58:15,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:15,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:15,459 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:15,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-17 19:58:15,461 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-17 19:58:15,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:15,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:15,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:15,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:15,473 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:58:15,473 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:58:15,477 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:15,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-03-17 19:58:15,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:15,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:15,485 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:15,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-17 19:58:15,488 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-17 19:58:15,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:15,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:15,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:15,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:15,500 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:58:15,500 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:58:15,503 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:15,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-03-17 19:58:15,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:15,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:15,511 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:15,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-17 19:58:15,513 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-17 19:58:15,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:15,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:15,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:15,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:15,526 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:58:15,526 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:58:15,530 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:15,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-03-17 19:58:15,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:15,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:15,538 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:15,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-17 19:58:15,540 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-17 19:58:15,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:15,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:15,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:58:15,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:15,552 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:58:15,552 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:58:15,557 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:58:15,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-03-17 19:58:15,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:15,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:15,565 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:15,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-03-17 19:58:15,567 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-17 19:58:15,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:58:15,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:58:15,577 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-17 19:58:15,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:58:15,593 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-03-17 19:58:15,593 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-03-17 19:58:15,611 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:58:15,668 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2025-03-17 19:58:15,670 INFO L444 ModelExtractionUtils]: 8 out of 31 variables were initially zero. Simplification set additionally 20 variables to zero. [2025-03-17 19:58:15,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:58:15,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:15,675 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:58:15,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-17 19:58:15,677 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:58:15,690 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2025-03-17 19:58:15,690 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:58:15,691 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_main_~MAX~0#1.base) 0)_1, v_rep(select (select #memory_int#2 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) 0)_1 - 1*v_rep(select (select #memory_int#2 ULTIMATE.start_main_~a~0#1.base) ULTIMATE.start_main_~a~0#1.offset)_1 Supporting invariants [] [2025-03-17 19:58:15,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-03-17 19:58:15,866 INFO L156 tatePredicateManager]: 36 out of 37 supporting invariants were superfluous and have been removed [2025-03-17 19:58:15,872 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-17 19:58:15,873 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-17 19:58:15,873 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~MAX~0!base,]]] [2025-03-17 19:58:15,874 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-03-17 19:58:15,874 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-03-17 19:58:15,874 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~a~0!base,]]] [2025-03-17 19:58:15,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:15,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:58:15,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:58:15,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:15,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:15,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:58:15,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:58:15,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:58:15,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:58:15,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:15,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:15,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 19:58:15,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:58:16,072 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-17 19:58:16,115 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-17 19:58:16,117 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-03-17 19:58:16,118 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:16,207 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 25 states and 29 transitions. Complement of second has 8 states. [2025-03-17 19:58:16,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 19:58:16,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:16,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2025-03-17 19:58:16,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 4 letters. Loop has 7 letters. [2025-03-17 19:58:16,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:58:16,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 11 letters. Loop has 7 letters. [2025-03-17 19:58:16,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:58:16,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 4 letters. Loop has 14 letters. [2025-03-17 19:58:16,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:58:16,212 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 29 transitions. [2025-03-17 19:58:16,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-17 19:58:16,213 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 29 transitions. [2025-03-17 19:58:16,213 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-03-17 19:58:16,213 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2025-03-17 19:58:16,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 29 transitions. [2025-03-17 19:58:16,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:58:16,213 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-03-17 19:58:16,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 29 transitions. [2025-03-17 19:58:16,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-17 19:58:16,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 states have internal predecessors, (29), 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-17 19:58:16,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2025-03-17 19:58:16,215 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-03-17 19:58:16,215 INFO L432 stractBuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-03-17 19:58:16,215 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 19:58:16,215 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2025-03-17 19:58:16,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-17 19:58:16,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:58:16,215 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:58:16,215 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:58:16,215 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:58:16,215 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#2(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#0(1, main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#2(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-17 19:58:16,215 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 write~int#3(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#0(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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#2(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-17 19:58:16,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:16,216 INFO L85 PathProgramCache]: Analyzing trace with hash -225101485, now seen corresponding path program 1 times [2025-03-17 19:58:16,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:16,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561603951] [2025-03-17 19:58:16,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:58:16,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:16,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 19:58:16,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:58:16,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:16,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:16,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-17 19:58:16,488 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-17 19:58:16,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:58:16,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561603951] [2025-03-17 19:58:16,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561603951] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:58:16,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811363062] [2025-03-17 19:58:16,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:58:16,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:58:16,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:16,491 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:58:16,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-03-17 19:58:16,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 19:58:16,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:58:16,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:16,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:16,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 19:58:16,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:58:16,576 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 15 treesize of output 1 [2025-03-17 19:58:16,584 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-17 19:58:16,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 36 treesize of output 13 [2025-03-17 19:58:16,701 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-17 19:58:16,722 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-17 19:58:16,722 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:58:16,817 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-17 19:58:16,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811363062] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:58:16,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:58:16,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2025-03-17 19:58:16,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527765841] [2025-03-17 19:58:16,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:58:16,818 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:58:16,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:16,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1346519853, now seen corresponding path program 3 times [2025-03-17 19:58:16,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:16,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302500255] [2025-03-17 19:58:16,818 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:58:16,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:16,823 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:58:16,826 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:58:16,826 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 19:58:16,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 19:58:16,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1754318320] [2025-03-17 19:58:16,827 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:58:16,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:58:16,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:16,831 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:58:16,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-03-17 19:58:16,875 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:58:16,888 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:58:16,888 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 19:58:16,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:16,888 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:58:16,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:58:16,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:58:16,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:16,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:16,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:58:17,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:58:17,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 19:58:17,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-17 19:58:17,917 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. cyclomatic complexity: 6 Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:18,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:58:18,060 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2025-03-17 19:58:18,060 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 66 transitions. [2025-03-17 19:58:18,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-17 19:58:18,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 45 states and 48 transitions. [2025-03-17 19:58:18,061 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2025-03-17 19:58:18,061 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2025-03-17 19:58:18,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 48 transitions. [2025-03-17 19:58:18,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:58:18,062 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 48 transitions. [2025-03-17 19:58:18,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 48 transitions. [2025-03-17 19:58:18,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2025-03-17 19:58:18,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:58:18,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2025-03-17 19:58:18,069 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 42 transitions. [2025-03-17 19:58:18,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 19:58:18,070 INFO L432 stractBuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2025-03-17 19:58:18,070 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 19:58:18,071 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 42 transitions. [2025-03-17 19:58:18,071 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-17 19:58:18,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:58:18,071 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:58:18,072 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 4, 1, 1] [2025-03-17 19:58:18,072 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:58:18,072 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#2(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#0(1, main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#2(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-17 19:58:18,072 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 write~int#3(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#0(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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#2(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-17 19:58:18,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:18,072 INFO L85 PathProgramCache]: Analyzing trace with hash -662449703, now seen corresponding path program 2 times [2025-03-17 19:58:18,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:18,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463690294] [2025-03-17 19:58:18,072 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:58:18,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:18,086 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-17 19:58:18,106 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 19:58:18,106 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:58:18,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:18,811 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-17 19:58:18,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:58:18,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463690294] [2025-03-17 19:58:18,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463690294] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:58:18,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7247407] [2025-03-17 19:58:18,811 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:58:18,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:58:18,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:18,814 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:58:18,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-03-17 19:58:18,878 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-17 19:58:18,925 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 19:58:18,925 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:58:18,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:18,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 19:58:18,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:58:18,940 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-17 19:58:18,959 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 15 treesize of output 1 [2025-03-17 19:58:18,997 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-17 19:58:19,055 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-17 19:58:19,110 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-17 19:58:19,154 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-17 19:58:19,211 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-17 19:58:19,230 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-17 19:58:19,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:58:19,489 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-17 19:58:19,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7247407] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:58:19,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:58:19,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2025-03-17 19:58:19,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781608682] [2025-03-17 19:58:19,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:58:19,491 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:58:19,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:19,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1346519853, now seen corresponding path program 4 times [2025-03-17 19:58:19,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:19,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522356985] [2025-03-17 19:58:19,491 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:58:19,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:19,497 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 7 statements into 2 equivalence classes. [2025-03-17 19:58:19,502 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:58:19,502 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:58:19,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 19:58:19,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1473738463] [2025-03-17 19:58:19,503 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:58:19,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:58:19,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:19,506 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:58:19,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-03-17 19:58:19,551 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 7 statements into 2 equivalence classes. [2025-03-17 19:58:19,578 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:58:19,578 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:58:19,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:19,578 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:58:19,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:58:19,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:58:19,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:19,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:19,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:58:20,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:58:20,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 19:58:20,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2025-03-17 19:58:20,531 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. cyclomatic complexity: 5 Second operand has 18 states, 17 states have (on average 4.235294117647059) internal successors, (72), 17 states have internal predecessors, (72), 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-17 19:58:20,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:58:20,870 INFO L93 Difference]: Finished difference Result 123 states and 126 transitions. [2025-03-17 19:58:20,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 126 transitions. [2025-03-17 19:58:20,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-17 19:58:20,873 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 87 states and 90 transitions. [2025-03-17 19:58:20,873 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2025-03-17 19:58:20,873 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2025-03-17 19:58:20,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 90 transitions. [2025-03-17 19:58:20,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:58:20,873 INFO L218 hiAutomatonCegarLoop]: Abstraction has 87 states and 90 transitions. [2025-03-17 19:58:20,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 90 transitions. [2025-03-17 19:58:20,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2025-03-17 19:58:20,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 81 states have (on average 1.037037037037037) internal successors, (84), 80 states have internal predecessors, (84), 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-17 19:58:20,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2025-03-17 19:58:20,876 INFO L240 hiAutomatonCegarLoop]: Abstraction has 81 states and 84 transitions. [2025-03-17 19:58:20,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 19:58:20,877 INFO L432 stractBuchiCegarLoop]: Abstraction has 81 states and 84 transitions. [2025-03-17 19:58:20,877 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-17 19:58:20,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 84 transitions. [2025-03-17 19:58:20,880 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-17 19:58:20,880 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:58:20,880 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:58:20,881 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 10, 10, 10, 10, 10, 1, 1] [2025-03-17 19:58:20,881 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:58:20,881 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#2(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#0(1, main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#2(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-17 19:58:20,882 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 write~int#3(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#0(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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#2(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-17 19:58:20,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:20,882 INFO L85 PathProgramCache]: Analyzing trace with hash -627803623, now seen corresponding path program 3 times [2025-03-17 19:58:20,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:20,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256799184] [2025-03-17 19:58:20,882 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:58:20,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:20,895 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 74 statements into 11 equivalence classes. [2025-03-17 19:58:20,939 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 19:58:20,939 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-17 19:58:20,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:22,372 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-17 19:58:22,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:58:22,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256799184] [2025-03-17 19:58:22,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256799184] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:58:22,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007952390] [2025-03-17 19:58:22,372 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:58:22,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:58:22,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:22,375 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:58:22,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-03-17 19:58:22,448 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 74 statements into 11 equivalence classes. [2025-03-17 19:58:23,568 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 19:58:23,568 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-17 19:58:23,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:23,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 899 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-17 19:58:23,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:58:23,592 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-17 19:58:23,598 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 15 treesize of output 1 [2025-03-17 19:58:23,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 36 treesize of output 13 [2025-03-17 19:58:23,660 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-17 19:58:23,693 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-17 19:58:23,742 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-17 19:58:23,786 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-17 19:58:23,830 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-17 19:58:23,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 19:58:23,913 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-17 19:58:23,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-17 19:58:24,008 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-17 19:58:24,065 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-17 19:58:24,085 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-17 19:58:24,085 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:58:24,712 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-17 19:58:24,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007952390] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:58:24,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:58:24,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 27 [2025-03-17 19:58:24,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991128056] [2025-03-17 19:58:24,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:58:24,713 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:58:24,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:24,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1346519853, now seen corresponding path program 5 times [2025-03-17 19:58:24,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:24,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798781753] [2025-03-17 19:58:24,713 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:58:24,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:24,718 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:58:24,721 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:58:24,721 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:58:24,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 19:58:24,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1628086471] [2025-03-17 19:58:24,722 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:58:24,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:58:24,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:24,724 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:58:24,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2025-03-17 19:58:24,769 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:58:24,791 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:58:24,791 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:58:24,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:24,791 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:58:24,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:58:24,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:58:24,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:58:24,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:58:24,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:58:25,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:58:25,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-17 19:58:25,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=480, Unknown=0, NotChecked=0, Total=812 [2025-03-17 19:58:25,834 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. cyclomatic complexity: 5 Second operand has 29 states, 28 states have (on average 5.5) internal successors, (154), 28 states have internal predecessors, (154), 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-17 19:58:26,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:58:26,738 INFO L93 Difference]: Finished difference Result 243 states and 246 transitions. [2025-03-17 19:58:26,738 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 243 states and 246 transitions. [2025-03-17 19:58:26,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-17 19:58:26,741 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 243 states to 171 states and 174 transitions. [2025-03-17 19:58:26,741 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2025-03-17 19:58:26,741 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2025-03-17 19:58:26,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 174 transitions. [2025-03-17 19:58:26,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:58:26,741 INFO L218 hiAutomatonCegarLoop]: Abstraction has 171 states and 174 transitions. [2025-03-17 19:58:26,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 174 transitions. [2025-03-17 19:58:26,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 165. [2025-03-17 19:58:26,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 165 states have (on average 1.018181818181818) internal successors, (168), 164 states have internal predecessors, (168), 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-17 19:58:26,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 168 transitions. [2025-03-17 19:58:26,751 INFO L240 hiAutomatonCegarLoop]: Abstraction has 165 states and 168 transitions. [2025-03-17 19:58:26,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-17 19:58:26,754 INFO L432 stractBuchiCegarLoop]: Abstraction has 165 states and 168 transitions. [2025-03-17 19:58:26,754 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-17 19:58:26,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 165 states and 168 transitions. [2025-03-17 19:58:26,755 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-17 19:58:26,757 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:58:26,757 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:58:26,763 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [23, 23, 22, 22, 22, 22, 22, 1, 1] [2025-03-17 19:58:26,763 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:58:26,763 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#2(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#0(1, main_~c~0#1.base, main_~c~0#1.offset, 4);" "assume true;call main_#t~mem6#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#2(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-17 19:58:26,764 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 write~int#3(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#0(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#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#2(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#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#0(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#2(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#2(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#2(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#2(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-17 19:58:26,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:58:26,764 INFO L85 PathProgramCache]: Analyzing trace with hash -2034836839, now seen corresponding path program 4 times [2025-03-17 19:58:26,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:58:26,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841640393] [2025-03-17 19:58:26,765 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:58:26,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:58:26,815 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 158 statements into 2 equivalence classes. [2025-03-17 19:58:26,869 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 19:58:26,869 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:58:26,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:58:31,388 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-17 19:58:31,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:58:31,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841640393] [2025-03-17 19:58:31,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841640393] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:58:31,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151775802] [2025-03-17 19:58:31,388 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:58:31,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:58:31,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:58:31,391 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:58:31,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2025-03-17 19:58:31,489 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 158 statements into 2 equivalence classes.