./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_monotonic.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_monotonic.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5e947ce3cb6be538c3110154d89a790a98803ec545aa8464d99fb543118ea442 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-12 00:22:46,208 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:22:46,290 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-12 00:22:46,297 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:22:46,298 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:22:46,331 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:22:46,332 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:22:46,332 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:22:46,333 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:22:46,334 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:22:46,335 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:22:46,335 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:22:46,335 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:22:46,336 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:22:46,336 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:22:46,338 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:22:46,338 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:22:46,339 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:22:46,339 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:22:46,339 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:22:46,343 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:22:46,344 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 00:22:46,344 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:22:46,344 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 00:22:46,345 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:22:46,345 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:22:46,345 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:22:46,346 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:22:46,346 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:22:46,346 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:22:46,346 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 00:22:46,346 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:22:46,347 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:22:46,347 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:22:46,347 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:22:46,347 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:22:46,348 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:22:46,348 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:22:46,348 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:22:46,349 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5e947ce3cb6be538c3110154d89a790a98803ec545aa8464d99fb543118ea442 [2024-10-12 00:22:46,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:22:46,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:22:46,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:22:46,661 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:22:46,662 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:22:46,663 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_monotonic.i [2024-10-12 00:22:48,284 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:22:48,489 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:22:48,489 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_monotonic.i [2024-10-12 00:22:48,503 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8b78b8821/7e8c41c12d7b4a42bd657d4834b2b74d/FLAGf7da76a40 [2024-10-12 00:22:48,844 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8b78b8821/7e8c41c12d7b4a42bd657d4834b2b74d [2024-10-12 00:22:48,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:22:48,848 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:22:48,849 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:22:48,849 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:22:48,856 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:22:48,857 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:22:48" (1/1) ... [2024-10-12 00:22:48,857 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a089656 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:22:48, skipping insertion in model container [2024-10-12 00:22:48,858 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:22:48" (1/1) ... [2024-10-12 00:22:48,877 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:22:49,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:22:49,107 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:22:49,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:22:49,173 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:22:49,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:22:49 WrapperNode [2024-10-12 00:22:49,178 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:22:49,179 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:22:49,179 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:22:49,179 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:22:49,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:22:49" (1/1) ... [2024-10-12 00:22:49,229 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:22:49" (1/1) ... [2024-10-12 00:22:49,247 INFO L138 Inliner]: procedures = 16, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 48 [2024-10-12 00:22:49,248 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:22:49,249 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:22:49,249 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:22:49,249 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:22:49,260 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:22:49" (1/1) ... [2024-10-12 00:22:49,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:22:49" (1/1) ... [2024-10-12 00:22:49,267 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:22:49" (1/1) ... [2024-10-12 00:22:49,284 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 2, 3]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-10-12 00:22:49,284 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:22:49" (1/1) ... [2024-10-12 00:22:49,284 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:22:49" (1/1) ... [2024-10-12 00:22:49,295 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:22:49" (1/1) ... [2024-10-12 00:22:49,298 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:22:49" (1/1) ... [2024-10-12 00:22:49,299 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:22:49" (1/1) ... [2024-10-12 00:22:49,300 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:22:49" (1/1) ... [2024-10-12 00:22:49,302 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:22:49,303 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:22:49,303 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:22:49,303 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:22:49,304 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:22:49" (1/1) ... [2024-10-12 00:22:49,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:49,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:49,338 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:22:49,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 00:22:49,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 00:22:49,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 00:22:49,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 00:22:49,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 00:22:49,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 00:22:49,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 00:22:49,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 00:22:49,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-12 00:22:49,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:22:49,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:22:49,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 00:22:49,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 00:22:49,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-12 00:22:49,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 00:22:49,459 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:22:49,461 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:22:49,576 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-12 00:22:49,577 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:22:49,588 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:22:49,588 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 00:22:49,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:22:49 BoogieIcfgContainer [2024-10-12 00:22:49,589 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:22:49,590 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:22:49,590 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:22:49,594 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:22:49,595 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:22:49,595 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 12:22:48" (1/3) ... [2024-10-12 00:22:49,596 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b519e16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:22:49, skipping insertion in model container [2024-10-12 00:22:49,596 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:22:49,597 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:22:49" (2/3) ... [2024-10-12 00:22:49,598 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b519e16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:22:49, skipping insertion in model container [2024-10-12 00:22:49,598 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:22:49,598 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:22:49" (3/3) ... [2024-10-12 00:22:49,600 INFO L332 chiAutomizerObserver]: Analyzing ICFG array_monotonic.i [2024-10-12 00:22:49,656 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:22:49,656 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:22:49,656 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:22:49,657 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:22:49,657 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:22:49,657 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:22:49,657 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:22:49,657 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:22:49,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:22:49,677 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-10-12 00:22:49,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:22:49,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:22:49,682 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:22:49,683 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:22:49,683 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:22:49,683 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:22:49,685 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-10-12 00:22:49,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:22:49,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:22:49,685 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:22:49,685 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:22:49,692 INFO L745 eck$LassoCheckResult]: Stem: 15#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 12#L20-3true [2024-10-12 00:22:49,693 INFO L747 eck$LassoCheckResult]: Loop: 12#L20-3true assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 16#L23true assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int#1(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 13#L20-2true main_~i~0#1 := 2 + main_~i~0#1; 12#L20-3true [2024-10-12 00:22:49,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:49,699 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-12 00:22:49,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:49,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283387323] [2024-10-12 00:22:49,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:49,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:49,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:49,872 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:22:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:49,909 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:22:49,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:49,912 INFO L85 PathProgramCache]: Analyzing trace with hash 39821, now seen corresponding path program 1 times [2024-10-12 00:22:49,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:49,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576827074] [2024-10-12 00:22:49,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:49,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:49,926 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:22:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:49,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:22:49,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:49,939 INFO L85 PathProgramCache]: Analyzing trace with hash 28698763, now seen corresponding path program 1 times [2024-10-12 00:22:49,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:49,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563861036] [2024-10-12 00:22:49,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:49,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:49,972 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:22:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:49,995 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:22:50,490 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:22:50,491 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:22:50,491 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:22:50,492 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:22:50,492 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:22:50,493 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:50,493 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:22:50,493 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:22:50,493 INFO L132 ssoRankerPreferences]: Filename of dumped script: array_monotonic.i_Iteration1_Lasso [2024-10-12 00:22:50,493 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:22:50,494 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:22:50,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:50,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:50,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:50,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:50,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:50,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:50,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:51,003 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:22:51,008 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:22:51,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:51,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:51,019 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:22:51,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-12 00:22:51,029 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:22:51,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:51,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:51,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:51,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:51,047 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:22:51,047 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:22:51,057 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:51,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-12 00:22:51,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:51,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:51,084 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:22:51,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-12 00:22:51,089 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:22:51,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:51,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:51,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:51,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:51,106 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:22:51,106 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:22:51,115 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:51,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-12 00:22:51,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:51,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:51,132 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:22:51,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-12 00:22:51,135 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:22:51,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:51,148 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:22:51,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:51,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:51,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:51,149 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:22:51,150 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:22:51,151 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:51,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-12 00:22:51,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:51,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:51,168 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:22:51,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-12 00:22:51,185 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:22:51,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:51,197 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:22:51,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:51,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:51,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:51,199 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:22:51,199 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:22:51,202 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:51,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-10-12 00:22:51,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:51,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:51,221 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:22:51,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-12 00:22:51,235 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:22:51,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:51,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:22:51,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:51,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:51,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:51,249 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:22:51,249 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:22:51,250 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:51,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-12 00:22:51,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:51,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:51,269 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:22:51,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-12 00:22:51,275 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:22:51,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:51,287 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:22:51,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:51,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:51,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:51,290 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:22:51,290 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:22:51,292 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:51,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-12 00:22:51,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:51,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:51,319 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:22:51,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-12 00:22:51,324 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:22:51,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:51,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:51,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:51,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:51,346 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:22:51,346 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:22:51,350 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:51,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-10-12 00:22:51,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:51,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:51,367 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:22:51,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-12 00:22:51,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:22:51,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:51,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:51,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:51,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:51,388 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:22:51,388 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:22:51,396 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:51,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-10-12 00:22:51,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:51,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:51,412 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:22:51,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-12 00:22:51,418 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:22:51,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:51,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:51,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:51,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:51,434 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:22:51,434 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:22:51,441 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:51,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-10-12 00:22:51,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:51,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:51,458 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:22:51,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-12 00:22:51,462 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:22:51,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:51,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:51,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:51,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:51,477 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:22:51,477 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:22:51,481 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:51,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-10-12 00:22:51,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:51,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:51,505 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:22:51,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-12 00:22:51,514 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:22:51,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:51,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:51,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:51,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:51,529 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:22:51,530 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:22:51,534 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:51,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-10-12 00:22:51,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:51,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:51,551 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:22:51,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-12 00:22:51,561 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:22:51,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:51,573 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:22:51,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:51,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:51,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:51,574 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:22:51,575 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:22:51,576 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:51,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-10-12 00:22:51,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:51,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:51,593 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:22:51,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-12 00:22:51,595 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:22:51,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:51,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:51,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:51,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:51,611 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:22:51,611 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:22:51,615 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:51,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-12 00:22:51,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:51,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:51,638 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:22:51,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-12 00:22:51,647 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:22:51,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:51,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:51,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:51,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:51,665 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:22:51,666 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:22:51,670 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:51,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-10-12 00:22:51,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:51,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:51,687 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:22:51,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-12 00:22:51,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:22:51,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:51,702 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:22:51,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:51,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:51,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:51,703 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:22:51,703 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:22:51,704 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:51,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-10-12 00:22:51,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:51,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:51,721 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:22:51,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-12 00:22:51,731 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:22:51,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:51,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:51,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:51,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:51,748 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:22:51,748 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:22:51,768 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:22:51,792 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-10-12 00:22:51,792 INFO L444 ModelExtractionUtils]: 2 out of 19 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-10-12 00:22:51,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:51,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:51,812 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:22:51,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-12 00:22:51,819 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:22:51,834 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:22:51,834 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:22:51,835 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 100000 Supporting invariants [] [2024-10-12 00:22:51,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-10-12 00:22:51,874 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2024-10-12 00:22:51,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:22:51,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:22:51,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:22:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:22:51,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:22:51,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:22:51,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:22:52,000 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-12 00:22:52,002 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:22:52,044 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 34 states and 49 transitions. Complement of second has 6 states. [2024-10-12 00:22:52,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-12 00:22:52,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:22:52,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2024-10-12 00:22:52,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 2 letters. Loop has 3 letters. [2024-10-12 00:22:52,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:22:52,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 5 letters. Loop has 3 letters. [2024-10-12 00:22:52,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:22:52,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 2 letters. Loop has 6 letters. [2024-10-12 00:22:52,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:22:52,055 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 49 transitions. [2024-10-12 00:22:52,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-12 00:22:52,060 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 15 states and 21 transitions. [2024-10-12 00:22:52,061 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-12 00:22:52,061 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-12 00:22:52,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 21 transitions. [2024-10-12 00:22:52,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:22:52,062 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 21 transitions. [2024-10-12 00:22:52,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 21 transitions. [2024-10-12 00:22:52,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-10-12 00:22:52,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:22:52,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2024-10-12 00:22:52,090 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 21 transitions. [2024-10-12 00:22:52,090 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2024-10-12 00:22:52,090 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:22:52,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2024-10-12 00:22:52,091 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-12 00:22:52,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:22:52,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:22:52,091 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-12 00:22:52,091 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:22:52,092 INFO L745 eck$LassoCheckResult]: Stem: 137#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 126#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 127#L20-3 assume !(main_~i~0#1 < 100000); 128#L20-4 main_~i~0#1 := 0; 129#L26-3 [2024-10-12 00:22:52,092 INFO L747 eck$LassoCheckResult]: Loop: 129#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 136#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 125#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 129#L26-3 [2024-10-12 00:22:52,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:52,092 INFO L85 PathProgramCache]: Analyzing trace with hash 925712, now seen corresponding path program 1 times [2024-10-12 00:22:52,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:52,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311868196] [2024-10-12 00:22:52,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:52,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:22:52,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:22:52,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:22:52,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311868196] [2024-10-12 00:22:52,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311868196] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:22:52,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:22:52,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:22:52,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678591676] [2024-10-12 00:22:52,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:22:52,162 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:22:52,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:52,162 INFO L85 PathProgramCache]: Analyzing trace with hash 59262, now seen corresponding path program 1 times [2024-10-12 00:22:52,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:52,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147953300] [2024-10-12 00:22:52,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:52,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:52,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:52,169 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:22:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:52,173 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:22:52,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:22:52,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:22:52,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:22:52,226 INFO L87 Difference]: Start difference. First operand 15 states and 21 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:22:52,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:22:52,248 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2024-10-12 00:22:52,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2024-10-12 00:22:52,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-12 00:22:52,250 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 19 states and 24 transitions. [2024-10-12 00:22:52,250 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-10-12 00:22:52,250 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-12 00:22:52,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2024-10-12 00:22:52,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:22:52,251 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 24 transitions. [2024-10-12 00:22:52,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2024-10-12 00:22:52,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 12. [2024-10-12 00:22:52,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:22:52,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2024-10-12 00:22:52,253 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 15 transitions. [2024-10-12 00:22:52,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:22:52,254 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2024-10-12 00:22:52,254 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:22:52,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2024-10-12 00:22:52,255 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-12 00:22:52,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:22:52,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:22:52,256 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:22:52,256 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:22:52,256 INFO L745 eck$LassoCheckResult]: Stem: 177#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 178#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 171#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 172#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 175#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 173#L20-3 assume !(main_~i~0#1 < 100000); 174#L20-4 main_~i~0#1 := 0; 170#L26-3 [2024-10-12 00:22:52,256 INFO L747 eck$LassoCheckResult]: Loop: 170#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 176#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 169#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 170#L26-3 [2024-10-12 00:22:52,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:52,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1809767318, now seen corresponding path program 1 times [2024-10-12 00:22:52,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:52,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423888430] [2024-10-12 00:22:52,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:52,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:22:52,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:22:52,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:22:52,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423888430] [2024-10-12 00:22:52,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423888430] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:22:52,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102302932] [2024-10-12 00:22:52,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:52,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:22:52,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:52,314 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:22:52,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-12 00:22:52,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:22:52,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 00:22:52,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:22:52,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-10-12 00:22:52,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:22:52,443 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:22:52,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:22:52,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102302932] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:22:52,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:22:52,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-12 00:22:52,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348831436] [2024-10-12 00:22:52,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:22:52,475 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:22:52,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:52,475 INFO L85 PathProgramCache]: Analyzing trace with hash 59262, now seen corresponding path program 2 times [2024-10-12 00:22:52,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:52,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194257884] [2024-10-12 00:22:52,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:52,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:52,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:52,485 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:22:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:52,492 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:22:52,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:22:52,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 00:22:52,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-12 00:22:52,542 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:22:52,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:22:52,600 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2024-10-12 00:22:52,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 46 transitions. [2024-10-12 00:22:52,602 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-12 00:22:52,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 46 transitions. [2024-10-12 00:22:52,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-10-12 00:22:52,603 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-10-12 00:22:52,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 46 transitions. [2024-10-12 00:22:52,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:22:52,604 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 46 transitions. [2024-10-12 00:22:52,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 46 transitions. [2024-10-12 00:22:52,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 21. [2024-10-12 00:22:52,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:22:52,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2024-10-12 00:22:52,610 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-10-12 00:22:52,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 00:22:52,614 INFO L425 stractBuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-10-12 00:22:52,614 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 00:22:52,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2024-10-12 00:22:52,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-12 00:22:52,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:22:52,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:22:52,618 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 1, 1, 1, 1] [2024-10-12 00:22:52,618 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:22:52,618 INFO L745 eck$LassoCheckResult]: Stem: 273#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 274#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 266#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 267#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 282#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 268#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 269#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 270#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 271#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 281#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 280#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 279#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 277#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 278#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 276#L20-3 assume !(main_~i~0#1 < 100000); 275#L20-4 main_~i~0#1 := 0; 265#L26-3 [2024-10-12 00:22:52,618 INFO L747 eck$LassoCheckResult]: Loop: 265#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 272#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 264#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 265#L26-3 [2024-10-12 00:22:52,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:52,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1825864560, now seen corresponding path program 2 times [2024-10-12 00:22:52,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:52,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014077194] [2024-10-12 00:22:52,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:52,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:22:52,777 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:22:52,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:22:52,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014077194] [2024-10-12 00:22:52,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014077194] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:22:52,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000827117] [2024-10-12 00:22:52,779 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:22:52,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:22:52,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:52,781 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:22:52,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-10-12 00:22:52,845 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 00:22:52,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:22:52,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:22:52,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:22:52,884 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:22:52,884 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:22:52,954 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:22:52,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000827117] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:22:52,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:22:52,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-10-12 00:22:52,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961913653] [2024-10-12 00:22:52,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:22:52,956 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:22:52,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:52,956 INFO L85 PathProgramCache]: Analyzing trace with hash 59262, now seen corresponding path program 3 times [2024-10-12 00:22:52,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:52,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704294036] [2024-10-12 00:22:52,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:52,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:52,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:52,962 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:22:52,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:52,965 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:22:53,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:22:53,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 00:22:53,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-12 00:22:53,010 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 8 Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:22:53,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:22:53,150 INFO L93 Difference]: Finished difference Result 85 states and 106 transitions. [2024-10-12 00:22:53,150 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 106 transitions. [2024-10-12 00:22:53,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-12 00:22:53,153 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 85 states and 106 transitions. [2024-10-12 00:22:53,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2024-10-12 00:22:53,153 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2024-10-12 00:22:53,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 106 transitions. [2024-10-12 00:22:53,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:22:53,154 INFO L218 hiAutomatonCegarLoop]: Abstraction has 85 states and 106 transitions. [2024-10-12 00:22:53,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 106 transitions. [2024-10-12 00:22:53,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 39. [2024-10-12 00:22:53,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 38 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:22:53,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2024-10-12 00:22:53,158 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 51 transitions. [2024-10-12 00:22:53,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 00:22:53,159 INFO L425 stractBuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2024-10-12 00:22:53,160 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 00:22:53,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 51 transitions. [2024-10-12 00:22:53,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-12 00:22:53,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:22:53,161 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:22:53,161 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 1, 1, 1, 1] [2024-10-12 00:22:53,162 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:22:53,162 INFO L745 eck$LassoCheckResult]: Stem: 485#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 486#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 478#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 479#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 487#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 480#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 481#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 482#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 483#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 512#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 511#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 510#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 509#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 508#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 507#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 506#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 505#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 504#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 503#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 502#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 501#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 500#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 499#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 498#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 497#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 496#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 495#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 494#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 493#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 492#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 490#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 491#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 489#L20-3 assume !(main_~i~0#1 < 100000); 488#L20-4 main_~i~0#1 := 0; 477#L26-3 [2024-10-12 00:22:53,162 INFO L747 eck$LassoCheckResult]: Loop: 477#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 484#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 476#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 477#L26-3 [2024-10-12 00:22:53,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:53,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1205177520, now seen corresponding path program 3 times [2024-10-12 00:22:53,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:53,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309344022] [2024-10-12 00:22:53,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:53,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:53,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:22:53,460 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:22:53,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:22:53,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309344022] [2024-10-12 00:22:53,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309344022] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:22:53,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357009364] [2024-10-12 00:22:53,460 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 00:22:53,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:22:53,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:53,466 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:22:53,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-10-12 00:22:53,609 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-10-12 00:22:53,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:22:53,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-12 00:22:53,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:22:53,662 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:22:53,663 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:22:53,917 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:22:53,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357009364] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:22:53,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:22:53,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-10-12 00:22:53,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421963215] [2024-10-12 00:22:53,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:22:53,919 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:22:53,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:53,919 INFO L85 PathProgramCache]: Analyzing trace with hash 59262, now seen corresponding path program 4 times [2024-10-12 00:22:53,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:53,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433546640] [2024-10-12 00:22:53,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:53,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:53,925 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:22:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:53,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:22:53,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:22:53,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-12 00:22:53,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-10-12 00:22:53,974 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. cyclomatic complexity: 14 Second operand has 25 states, 25 states have (on average 2.8) internal successors, (70), 25 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:22:54,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:22:54,230 INFO L93 Difference]: Finished difference Result 181 states and 226 transitions. [2024-10-12 00:22:54,230 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 181 states and 226 transitions. [2024-10-12 00:22:54,233 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-12 00:22:54,234 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 181 states to 181 states and 226 transitions. [2024-10-12 00:22:54,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2024-10-12 00:22:54,235 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2024-10-12 00:22:54,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 181 states and 226 transitions. [2024-10-12 00:22:54,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:22:54,236 INFO L218 hiAutomatonCegarLoop]: Abstraction has 181 states and 226 transitions. [2024-10-12 00:22:54,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states and 226 transitions. [2024-10-12 00:22:54,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 75. [2024-10-12 00:22:54,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.32) internal successors, (99), 74 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:22:54,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 99 transitions. [2024-10-12 00:22:54,241 INFO L240 hiAutomatonCegarLoop]: Abstraction has 75 states and 99 transitions. [2024-10-12 00:22:54,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-12 00:22:54,246 INFO L425 stractBuchiCegarLoop]: Abstraction has 75 states and 99 transitions. [2024-10-12 00:22:54,246 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-12 00:22:54,246 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 99 transitions. [2024-10-12 00:22:54,247 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-12 00:22:54,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:22:54,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:22:54,249 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 22, 1, 1, 1, 1] [2024-10-12 00:22:54,249 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:22:54,249 INFO L745 eck$LassoCheckResult]: Stem: 932#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 933#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 924#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 925#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 931#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 926#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 927#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 928#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 929#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 994#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 993#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 992#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 991#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 990#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 989#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 988#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 987#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 986#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 985#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 984#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 983#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 982#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 981#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 980#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 979#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 978#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 977#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 976#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 975#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 974#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 973#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 972#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 971#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 970#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 969#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 968#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 967#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 966#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 965#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 964#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 963#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 962#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 961#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 960#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 959#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 958#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 957#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 956#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 955#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 954#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 953#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 952#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 951#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 950#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 949#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 948#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 947#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 946#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 945#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 944#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 943#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 942#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 941#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 940#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 939#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 938#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 936#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 937#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 935#L20-3 assume !(main_~i~0#1 < 100000); 934#L20-4 main_~i~0#1 := 0; 923#L26-3 [2024-10-12 00:22:54,250 INFO L747 eck$LassoCheckResult]: Loop: 923#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 930#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 922#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 923#L26-3 [2024-10-12 00:22:54,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:54,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1121042640, now seen corresponding path program 4 times [2024-10-12 00:22:54,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:54,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644554991] [2024-10-12 00:22:54,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:54,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:22:54,830 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:22:54,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:22:54,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644554991] [2024-10-12 00:22:54,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644554991] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:22:54,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165209390] [2024-10-12 00:22:54,831 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-12 00:22:54,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:22:54,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:54,840 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:22:54,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-10-12 00:22:54,973 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-12 00:22:54,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:22:54,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-12 00:22:54,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:22:55,093 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:22:55,094 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:22:55,858 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:22:55,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165209390] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:22:55,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:22:55,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2024-10-12 00:22:55,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377998342] [2024-10-12 00:22:55,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:22:55,859 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:22:55,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:55,860 INFO L85 PathProgramCache]: Analyzing trace with hash 59262, now seen corresponding path program 5 times [2024-10-12 00:22:55,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:55,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187545687] [2024-10-12 00:22:55,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:55,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:55,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:55,867 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:22:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:55,870 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:22:55,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:22:55,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-10-12 00:22:55,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2024-10-12 00:22:55,921 INFO L87 Difference]: Start difference. First operand 75 states and 99 transitions. cyclomatic complexity: 26 Second operand has 49 states, 49 states have (on average 2.8979591836734695) internal successors, (142), 49 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:22:56,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:22:56,713 INFO L93 Difference]: Finished difference Result 373 states and 466 transitions. [2024-10-12 00:22:56,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 373 states and 466 transitions. [2024-10-12 00:22:56,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-12 00:22:56,718 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 373 states to 373 states and 466 transitions. [2024-10-12 00:22:56,718 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 235 [2024-10-12 00:22:56,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 235 [2024-10-12 00:22:56,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 373 states and 466 transitions. [2024-10-12 00:22:56,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:22:56,720 INFO L218 hiAutomatonCegarLoop]: Abstraction has 373 states and 466 transitions. [2024-10-12 00:22:56,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states and 466 transitions. [2024-10-12 00:22:56,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 147. [2024-10-12 00:22:56,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 147 states have (on average 1.3265306122448979) internal successors, (195), 146 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:22:56,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 195 transitions. [2024-10-12 00:22:56,729 INFO L240 hiAutomatonCegarLoop]: Abstraction has 147 states and 195 transitions. [2024-10-12 00:22:56,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-10-12 00:22:56,736 INFO L425 stractBuchiCegarLoop]: Abstraction has 147 states and 195 transitions. [2024-10-12 00:22:56,736 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-12 00:22:56,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 147 states and 195 transitions. [2024-10-12 00:22:56,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-12 00:22:56,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:22:56,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:22:56,745 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 46, 46, 1, 1, 1, 1] [2024-10-12 00:22:56,745 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:22:56,745 INFO L745 eck$LassoCheckResult]: Stem: 1846#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 1847#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 1840#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1841#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1845#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1842#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1843#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1838#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1839#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1980#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1979#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1978#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1977#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1976#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1975#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1974#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1973#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1972#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1971#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1970#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1969#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1968#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1967#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1966#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1965#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1964#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1963#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1962#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1961#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1960#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1959#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1958#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1957#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1956#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1955#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1954#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1953#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1952#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1951#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1950#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1949#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1948#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1947#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1946#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1945#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1944#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1943#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1942#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1941#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1940#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1939#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1938#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1937#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1936#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1935#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1934#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1933#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1932#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1931#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1930#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1929#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1928#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1927#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1926#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1925#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1924#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1923#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1922#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1921#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1920#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1919#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1918#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1917#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1916#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1915#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1914#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1913#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1912#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1911#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1910#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1909#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1908#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1907#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1906#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1905#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1904#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1903#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1902#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1901#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1900#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1899#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1898#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1897#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1896#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1895#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1894#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1893#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1892#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1891#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1890#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1889#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1888#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1887#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1886#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1885#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1884#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1883#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1882#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1881#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1880#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1879#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1878#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1877#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1876#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1875#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1874#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1873#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1872#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1871#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1870#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1869#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1868#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1867#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1866#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1865#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1864#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1863#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1862#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1861#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1860#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1859#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1858#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1857#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1856#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1855#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1854#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1853#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1852#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1850#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1851#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1849#L20-3 assume !(main_~i~0#1 < 100000); 1848#L20-4 main_~i~0#1 := 0; 1837#L26-3 [2024-10-12 00:22:56,746 INFO L747 eck$LassoCheckResult]: Loop: 1837#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1844#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 1836#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 1837#L26-3 [2024-10-12 00:22:56,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:56,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1788222416, now seen corresponding path program 5 times [2024-10-12 00:22:56,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:56,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389734503] [2024-10-12 00:22:56,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:56,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:22:58,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:22:58,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:22:58,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389734503] [2024-10-12 00:22:58,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389734503] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:22:58,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592641965] [2024-10-12 00:22:58,829 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-12 00:22:58,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:22:58,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:58,831 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:22:58,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-10-12 00:24:17,507 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2024-10-12 00:24:17,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:24:17,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-12 00:24:17,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:24:17,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:24:17,814 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:24:20,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:24:20,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592641965] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:24:20,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:24:20,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2024-10-12 00:24:20,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258368023] [2024-10-12 00:24:20,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:24:20,685 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:24:20,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:24:20,686 INFO L85 PathProgramCache]: Analyzing trace with hash 59262, now seen corresponding path program 6 times [2024-10-12 00:24:20,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:24:20,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154353258] [2024-10-12 00:24:20,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:24:20,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:24:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:24:20,691 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:24:20,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:24:20,694 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:24:20,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:24:20,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2024-10-12 00:24:20,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2024-10-12 00:24:20,735 INFO L87 Difference]: Start difference. First operand 147 states and 195 transitions. cyclomatic complexity: 50 Second operand has 97 states, 97 states have (on average 2.948453608247423) internal successors, (286), 97 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:24:23,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:24:23,734 INFO L93 Difference]: Finished difference Result 757 states and 946 transitions. [2024-10-12 00:24:23,734 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 757 states and 946 transitions. [2024-10-12 00:24:23,741 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-12 00:24:23,751 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 757 states to 757 states and 946 transitions. [2024-10-12 00:24:23,751 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 475 [2024-10-12 00:24:23,752 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 475 [2024-10-12 00:24:23,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 757 states and 946 transitions. [2024-10-12 00:24:23,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:24:23,758 INFO L218 hiAutomatonCegarLoop]: Abstraction has 757 states and 946 transitions. [2024-10-12 00:24:23,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states and 946 transitions. [2024-10-12 00:24:23,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 291. [2024-10-12 00:24:23,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 291 states have (on average 1.3298969072164948) internal successors, (387), 290 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:24:23,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 387 transitions. [2024-10-12 00:24:23,779 INFO L240 hiAutomatonCegarLoop]: Abstraction has 291 states and 387 transitions. [2024-10-12 00:24:23,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-10-12 00:24:23,780 INFO L425 stractBuchiCegarLoop]: Abstraction has 291 states and 387 transitions. [2024-10-12 00:24:23,780 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-12 00:24:23,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 291 states and 387 transitions. [2024-10-12 00:24:23,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-12 00:24:23,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:24:23,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:24:23,787 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [94, 94, 94, 1, 1, 1, 1] [2024-10-12 00:24:23,788 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:24:23,790 INFO L745 eck$LassoCheckResult]: Stem: 3696#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 3697#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 3690#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3691#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3695#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3692#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3693#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3688#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3689#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3974#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3973#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3972#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3971#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3970#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3969#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3968#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3967#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3966#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3965#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3964#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3963#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3962#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3961#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3960#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3959#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3958#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3957#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3956#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3955#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3954#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3953#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3952#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3951#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3950#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3949#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3948#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3947#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3946#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3945#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3944#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3943#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3942#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3941#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3940#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3939#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3938#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3937#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3936#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3935#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3934#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3933#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3932#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3931#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3930#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3929#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3928#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3927#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3926#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3925#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3924#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3923#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3922#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3921#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3920#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3919#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3918#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3917#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3916#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3915#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3914#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3913#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3912#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3911#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3910#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3909#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3908#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3907#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3906#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3905#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3904#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3903#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3902#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3901#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3900#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3899#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3898#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3897#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3896#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3895#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3894#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3893#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3892#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3891#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3890#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3889#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3888#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3887#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3886#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3885#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3884#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3883#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3882#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3881#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3880#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3879#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3878#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3877#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3876#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3875#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3874#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3873#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3872#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3871#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3870#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3869#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3868#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3867#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3866#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3865#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3864#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3863#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3862#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3861#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3860#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3859#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3858#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3857#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3856#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3855#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3854#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3853#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3852#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3851#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3850#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3849#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3848#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3847#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3846#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3845#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3844#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3843#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3842#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3841#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3840#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3839#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3838#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3837#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3836#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3835#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3834#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3833#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3832#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3831#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3830#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3829#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3828#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3827#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3826#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3825#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3824#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3823#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3822#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3821#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3820#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3819#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3818#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3817#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3816#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3815#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3814#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3813#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3812#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3811#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3810#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3809#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3808#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3807#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3806#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3805#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3804#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3803#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3802#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3801#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3800#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3799#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3798#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3797#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3796#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3795#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3794#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3793#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3792#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3791#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3790#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3789#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3788#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3787#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3786#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3785#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3784#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3783#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3782#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3781#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3780#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3779#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3778#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3777#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3776#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3775#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3774#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3773#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3772#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3771#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3770#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3769#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3768#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3767#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3766#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3765#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3764#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3763#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3762#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3761#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3760#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3759#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3758#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3757#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3756#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3755#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3754#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3753#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3752#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3751#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3750#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3749#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3748#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3747#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3746#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3745#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3744#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3743#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3742#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3741#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3740#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3739#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3738#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3737#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3736#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3735#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3734#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3733#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3732#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3731#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3730#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3729#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3728#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3727#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3726#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3725#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3724#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3723#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3722#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3721#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3720#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3719#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3718#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3717#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3716#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3715#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3714#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3713#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3712#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3711#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3710#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3709#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3708#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3707#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3706#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3705#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3704#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3703#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3702#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3700#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3701#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3699#L20-3 assume !(main_~i~0#1 < 100000); 3698#L20-4 main_~i~0#1 := 0; 3687#L26-3 [2024-10-12 00:24:23,793 INFO L747 eck$LassoCheckResult]: Loop: 3687#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3694#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 3686#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 3687#L26-3 [2024-10-12 00:24:23,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:24:23,794 INFO L85 PathProgramCache]: Analyzing trace with hash 712364496, now seen corresponding path program 6 times [2024-10-12 00:24:23,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:24:23,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447693743] [2024-10-12 00:24:23,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:24:23,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:24:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat