./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_mul_init.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_mul_init.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 09dc663f7f76eee13b6af61297831e3fbddcb16c16389bf8d94f2d27048733d0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-12 00:22:46,453 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:22:46,555 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,567 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:22:46,568 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:22:46,609 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:22:46,614 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:22:46,614 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:22:46,615 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:22:46,615 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:22:46,616 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:22:46,616 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:22:46,616 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:22:46,616 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:22:46,617 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:22:46,617 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:22:46,617 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:22:46,617 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:22:46,618 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:22:46,618 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:22:46,618 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:22:46,619 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 00:22:46,619 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:22:46,620 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 00:22:46,620 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:22:46,620 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:22:46,621 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:22:46,621 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:22:46,621 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:22:46,622 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:22:46,622 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 00:22:46,622 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:22:46,623 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:22:46,623 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:22:46,623 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:22:46,624 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:22:46,624 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:22:46,624 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:22:46,625 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:22:46,625 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 -> 09dc663f7f76eee13b6af61297831e3fbddcb16c16389bf8d94f2d27048733d0 [2024-10-12 00:22:46,879 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:22:46,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:22:46,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:22:46,912 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:22:46,913 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:22:46,914 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_mul_init.i [2024-10-12 00:22:48,551 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:22:48,718 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:22:48,718 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_mul_init.i [2024-10-12 00:22:48,725 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ed5c1e130/434cf577e8854d0f92e86881ed6412e9/FLAG9fa73433d [2024-10-12 00:22:48,736 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ed5c1e130/434cf577e8854d0f92e86881ed6412e9 [2024-10-12 00:22:48,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:22:48,739 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:22:48,740 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:22:48,740 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:22:48,744 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:22:48,745 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,745 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45594932 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,745 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,760 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:22:48,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:22:48,923 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:22:48,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:22:48,955 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:22:48,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:22:48 WrapperNode [2024-10-12 00:22:48,955 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:22:48,956 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:22:48,956 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:22:48,957 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:22:48,962 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:48" (1/1) ... [2024-10-12 00:22:48,969 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:48" (1/1) ... [2024-10-12 00:22:48,990 INFO L138 Inliner]: procedures = 16, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2024-10-12 00:22:48,991 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:22:48,991 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:22:48,991 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:22:48,991 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:22:49,002 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:48" (1/1) ... [2024-10-12 00:22:49,002 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:48" (1/1) ... [2024-10-12 00:22:49,004 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:48" (1/1) ... [2024-10-12 00:22:49,022 INFO L175 MemorySlicer]: Split 11 memory accesses to 3 slices as follows [2, 5, 4]. 45 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 4 writes are split as follows [0, 2, 2]. [2024-10-12 00:22:49,023 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:48" (1/1) ... [2024-10-12 00:22:49,023 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:48" (1/1) ... [2024-10-12 00:22:49,029 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:48" (1/1) ... [2024-10-12 00:22:49,034 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:48" (1/1) ... [2024-10-12 00:22:49,035 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:48" (1/1) ... [2024-10-12 00:22:49,036 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:48" (1/1) ... [2024-10-12 00:22:49,037 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:22:49,038 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:22:49,038 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:22:49,038 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:22:49,041 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:22:48" (1/1) ... [2024-10-12 00:22:49,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:49,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:49,075 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,081 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,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 00:22:49,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 00:22:49,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 00:22:49,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 00:22:49,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 00:22:49,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 00:22:49,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 00:22:49,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-12 00:22:49,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:22:49,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:22:49,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 00:22:49,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 00:22:49,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-12 00:22:49,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 00:22:49,199 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:22:49,201 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:22:49,396 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-12 00:22:49,397 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:22:49,406 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:22:49,407 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-12 00:22:49,407 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,407 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:22:49,408 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:22:49,408 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:22:49,411 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:22:49,412 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:22:49,412 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,413 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d0e864a 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,413 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:22:49,413 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:22:48" (2/3) ... [2024-10-12 00:22:49,413 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d0e864a 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,413 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:22:49,414 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,414 INFO L332 chiAutomizerObserver]: Analyzing ICFG array_mul_init.i [2024-10-12 00:22:49,457 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:22:49,457 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:22:49,457 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:22:49,457 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:22:49,458 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:22:49,458 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:22:49,458 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:22:49,458 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:22:49,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 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,473 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2024-10-12 00:22:49,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:22:49,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:22:49,477 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:22:49,477 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:22:49,478 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:22:49,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 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,479 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2024-10-12 00:22:49,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:22:49,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:22:49,479 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:22:49,480 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:22:49,487 INFO L745 eck$LassoCheckResult]: Stem: 17#$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(17, 2); 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem9#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short10#1, main_#t~post11#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~k~0#1, 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);havoc main_~k~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 4#L21-3true [2024-10-12 00:22:49,487 INFO L747 eck$LassoCheckResult]: Loop: 4#L21-3true assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 18#L21-2true main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 4#L21-3true [2024-10-12 00:22:49,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:49,492 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-12 00:22:49,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:49,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60632326] [2024-10-12 00:22:49,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:49,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:49,583 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:22:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:49,608 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:22:49,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:49,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2024-10-12 00:22:49,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:49,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108891004] [2024-10-12 00:22:49,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:49,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:49,631 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:22:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:49,646 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:22:49,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:49,648 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2024-10-12 00:22:49,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:49,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737898392] [2024-10-12 00:22:49,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:49,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:49,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:49,689 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:22:49,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:49,704 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:22:50,119 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:22:50,122 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:22:50,122 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:22:50,122 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:22:50,122 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:22:50,122 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:50,123 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:22:50,123 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:22:50,123 INFO L132 ssoRankerPreferences]: Filename of dumped script: array_mul_init.i_Iteration1_Lasso [2024-10-12 00:22:50,124 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:22:50,124 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:22:50,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:50,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:50,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:50,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:50,188 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:50,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:50,455 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:50,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:50,460 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:50,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:50,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:50,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:50,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:50,473 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:50,475 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:22:50,698 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:22:50,701 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:22:50,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:50,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:50,707 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:50,715 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:50,717 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:50,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:50,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:50,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:50,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:50,748 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:22:50,748 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:22:50,756 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:50,776 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:50,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:50,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:50,800 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:50,808 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:50,809 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:50,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:50,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:50,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:50,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:50,834 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:22:50,834 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:22:50,842 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:50,864 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:50,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:50,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:50,868 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:50,869 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:50,870 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:50,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:50,880 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:22:50,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:50,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:50,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:50,886 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:22:50,886 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:22:50,891 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:50,909 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:50,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:50,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:50,911 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:50,913 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:50,914 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:50,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:50,925 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:22:50,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:50,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:50,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:50,926 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:22:50,926 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:22:50,928 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:50,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-12 00:22:50,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:50,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:50,943 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:50,944 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:50,945 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:50,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:50,956 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:22:50,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:50,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:50,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:50,957 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:22:50,958 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:22:50,961 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:50,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-10-12 00:22:50,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:50,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:50,976 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:50,978 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:50,979 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:50,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:50,991 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:22:50,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:50,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:50,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:50,992 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:22:50,992 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:22:50,997 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:51,011 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,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:51,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:51,017 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,055 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,057 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,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:51,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:51,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:51,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:51,073 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:22:51,073 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:22:51,078 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:51,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-12 00:22:51,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:51,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:51,098 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,106 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,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:22:51,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:51,120 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:22:51,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:51,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:51,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:51,121 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:22:51,121 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:22:51,125 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:51,142 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,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:51,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:51,147 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,151 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,152 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,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:51,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:51,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:51,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:51,165 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:22:51,165 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:22:51,168 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:51,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-10-12 00:22:51,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:51,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:51,187 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,189 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,190 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,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:51,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:51,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:51,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:51,206 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:22:51,207 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:22:51,210 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:51,225 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,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:51,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:51,227 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,229 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,230 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,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:51,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:51,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:51,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:51,242 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:22:51,242 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:22:51,245 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:51,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-10-12 00:22:51,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:51,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:51,261 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,262 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,263 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,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:51,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:51,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:51,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:51,275 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:22:51,275 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:22:51,278 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:51,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-12 00:22:51,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:51,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:51,290 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,291 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,293 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,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:51,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:51,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:51,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:51,305 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:22:51,305 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:22:51,308 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:51,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-10-12 00:22:51,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:51,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:51,323 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,326 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,327 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,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:51,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:51,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:51,339 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,353 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:22:51,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-12 00:22:51,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:51,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:51,374 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,382 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,384 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,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:22:51,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:22:51,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:22:51,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:22:51,406 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:22:51,406 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:22:51,416 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:22:51,489 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2024-10-12 00:22:51,493 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 16 variables to zero. [2024-10-12 00:22:51,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:22:51,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:51,498 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,504 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,505 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:22:51,527 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:22:51,527 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:22:51,527 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = 199999*v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1 - 8*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-10-12 00:22:51,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-10-12 00:22:51,591 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2024-10-12 00:22:51,600 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-12 00:22:51,601 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-12 00:22:51,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:22:51,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:22:51,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:22:51,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:22:51,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:22:51,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:22:51,723 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:51,758 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:51,760 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 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.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:51,806 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 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.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) Result 42 states and 61 transitions. Complement of second has 6 states. [2024-10-12 00:22:51,811 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:51,816 INFO L82 GeneralOperation]: Start removeUnreachable. 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:51,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2024-10-12 00:22:51,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 2 letters. Loop has 2 letters. [2024-10-12 00:22:51,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:22:51,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 4 letters. Loop has 2 letters. [2024-10-12 00:22:51,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:22:51,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 2 letters. Loop has 4 letters. [2024-10-12 00:22:51,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:22:51,819 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 61 transitions. [2024-10-12 00:22:51,822 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-10-12 00:22:51,826 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 19 states and 27 transitions. [2024-10-12 00:22:51,827 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-10-12 00:22:51,827 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-10-12 00:22:51,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 27 transitions. [2024-10-12 00:22:51,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:22:51,828 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 27 transitions. [2024-10-12 00:22:51,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 27 transitions. [2024-10-12 00:22:51,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-10-12 00:22:51,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 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:51,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2024-10-12 00:22:51,853 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 27 transitions. [2024-10-12 00:22:51,853 INFO L425 stractBuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2024-10-12 00:22:51,853 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:22:51,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. [2024-10-12 00:22:51,854 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-10-12 00:22:51,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:22:51,854 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:22:51,855 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-12 00:22:51,855 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:22:51,855 INFO L745 eck$LassoCheckResult]: Stem: 150#$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(17, 2); 141#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem9#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short10#1, main_#t~post11#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~k~0#1, 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);havoc main_~k~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 134#L21-3 assume !(main_~i~0#1 < 100000); 135#L21-4 main_~i~0#1 := 0; 148#L26-3 [2024-10-12 00:22:51,855 INFO L747 eck$LassoCheckResult]: Loop: 148#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 149#L28 assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;call write~int#1(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 147#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 148#L26-3 [2024-10-12 00:22:51,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:51,856 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2024-10-12 00:22:51,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:51,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926652678] [2024-10-12 00:22:51,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:51,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:51,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:22:51,917 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:51,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:22:51,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926652678] [2024-10-12 00:22:51,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926652678] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:22:51,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:22:51,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:22:51,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335764407] [2024-10-12 00:22:51,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:22:51,921 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:22:51,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:51,922 INFO L85 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 1 times [2024-10-12 00:22:51,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:51,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217641036] [2024-10-12 00:22:51,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:51,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:51,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 00:22:51,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1591766877] [2024-10-12 00:22:51,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:51,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:22:51,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:51,935 INFO L229 MonitoredProcess]: Starting monitored process 18 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:51,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-12 00:22:51,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:51,972 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:22:51,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:51,978 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:22:52,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:22:52,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:22:52,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:22:52,065 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. cyclomatic complexity: 11 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,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:22:52,096 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2024-10-12 00:22:52,096 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 36 transitions. [2024-10-12 00:22:52,097 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-10-12 00:22:52,097 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 26 states and 32 transitions. [2024-10-12 00:22:52,097 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-10-12 00:22:52,097 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2024-10-12 00:22:52,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2024-10-12 00:22:52,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:22:52,098 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-10-12 00:22:52,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2024-10-12 00:22:52,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 17. [2024-10-12 00:22:52,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-10-12 00:22:52,099 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-10-12 00:22:52,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:22:52,101 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-10-12 00:22:52,101 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:22:52,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2024-10-12 00:22:52,102 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-10-12 00:22:52,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:22:52,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:22:52,102 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:22:52,102 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:22:52,103 INFO L745 eck$LassoCheckResult]: Stem: 202#$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(17, 2); 195#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem9#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short10#1, main_#t~post11#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~k~0#1, 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);havoc main_~k~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 187#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 188#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 189#L21-3 assume !(main_~i~0#1 < 100000); 190#L21-4 main_~i~0#1 := 0; 203#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 201#L28 [2024-10-12 00:22:52,103 INFO L747 eck$LassoCheckResult]: Loop: 201#L28 assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;call write~int#1(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 198#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 199#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 201#L28 [2024-10-12 00:22:52,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:52,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1809669547, now seen corresponding path program 1 times [2024-10-12 00:22:52,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:52,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931045258] [2024-10-12 00:22:52,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:52,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:22:52,181 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,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:22:52,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931045258] [2024-10-12 00:22:52,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931045258] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:22:52,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542698793] [2024-10-12 00:22:52,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:52,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:22:52,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:52,183 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,185 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,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:22:52,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 00:22:52,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:22:52,235 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,236 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:22:52,250 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,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542698793] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:22:52,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:22:52,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-12 00:22:52,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432869789] [2024-10-12 00:22:52,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:22:52,251 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:22:52,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:52,251 INFO L85 PathProgramCache]: Analyzing trace with hash 56723, now seen corresponding path program 2 times [2024-10-12 00:22:52,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:52,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842682702] [2024-10-12 00:22:52,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:52,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 00:22:52,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1284614693] [2024-10-12 00:22:52,257 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:22:52,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:22:52,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:52,259 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,261 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,296 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-12 00:22:52,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-12 00:22:52,296 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:22:52,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:52,302 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:22:52,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:22:52,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 00:22:52,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-12 00:22:52,379 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 7 Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:22:52,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:22:52,441 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2024-10-12 00:22:52,441 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 61 transitions. [2024-10-12 00:22:52,442 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-10-12 00:22:52,443 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 61 transitions. [2024-10-12 00:22:52,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2024-10-12 00:22:52,443 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2024-10-12 00:22:52,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 61 transitions. [2024-10-12 00:22:52,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:22:52,444 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 61 transitions. [2024-10-12 00:22:52,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 61 transitions. [2024-10-12 00:22:52,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2024-10-12 00:22:52,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.21875) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:22:52,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2024-10-12 00:22:52,446 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-10-12 00:22:52,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 00:22:52,447 INFO L425 stractBuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-10-12 00:22:52,447 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 00:22:52,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 39 transitions. [2024-10-12 00:22:52,448 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-10-12 00:22:52,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:22:52,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:22:52,449 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 1, 1, 1, 1] [2024-10-12 00:22:52,449 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:22:52,449 INFO L745 eck$LassoCheckResult]: Stem: 316#$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(17, 2); 309#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem9#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short10#1, main_#t~post11#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~k~0#1, 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);havoc main_~k~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 301#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 302#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 303#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 304#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 328#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 326#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 324#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 322#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 321#L21-3 assume !(main_~i~0#1 < 100000); 317#L21-4 main_~i~0#1 := 0; 318#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 315#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 312#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 313#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 332#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 331#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 330#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 329#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 327#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 325#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 320#L28 [2024-10-12 00:22:52,449 INFO L747 eck$LassoCheckResult]: Loop: 320#L28 assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;call write~int#1(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 323#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 319#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 320#L28 [2024-10-12 00:22:52,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:52,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1950889807, now seen corresponding path program 1 times [2024-10-12 00:22:52,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:52,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389456357] [2024-10-12 00:22:52,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:52,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:52,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:22:52,584 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:52,602 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 00:22:52,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:22:52,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389456357] [2024-10-12 00:22:52,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389456357] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:22:52,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67355367] [2024-10-12 00:22:52,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:52,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:22:52,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:52,605 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:52,606 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:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:22:52,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:22:52,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:22:52,687 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 00:22:52,687 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:22:52,763 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 00:22:52,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67355367] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:22:52,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:22:52,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-10-12 00:22:52,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939164986] [2024-10-12 00:22:52,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:22:52,765 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:22:52,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:52,765 INFO L85 PathProgramCache]: Analyzing trace with hash 56723, now seen corresponding path program 3 times [2024-10-12 00:22:52,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:52,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581109043] [2024-10-12 00:22:52,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:52,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:52,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 00:22:52,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [498312320] [2024-10-12 00:22:52,783 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 00:22:52,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:22:52,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:52,787 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:52,795 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:52,841 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-10-12 00:22:52,841 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-12 00:22:52,842 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:22:52,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:52,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:22:52,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:22:52,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 00:22:52,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-12 00:22:52,979 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. cyclomatic complexity: 10 Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:22:53,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:22:53,172 INFO L93 Difference]: Finished difference Result 117 states and 139 transitions. [2024-10-12 00:22:53,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 139 transitions. [2024-10-12 00:22:53,174 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-10-12 00:22:53,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 117 states and 139 transitions. [2024-10-12 00:22:53,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2024-10-12 00:22:53,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97 [2024-10-12 00:22:53,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 139 transitions. [2024-10-12 00:22:53,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:22:53,177 INFO L218 hiAutomatonCegarLoop]: Abstraction has 117 states and 139 transitions. [2024-10-12 00:22:53,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 139 transitions. [2024-10-12 00:22:53,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 62. [2024-10-12 00:22:53,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 61 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:22:53,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2024-10-12 00:22:53,182 INFO L240 hiAutomatonCegarLoop]: Abstraction has 62 states and 75 transitions. [2024-10-12 00:22:53,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 00:22:53,183 INFO L425 stractBuchiCegarLoop]: Abstraction has 62 states and 75 transitions. [2024-10-12 00:22:53,183 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 00:22:53,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 75 transitions. [2024-10-12 00:22:53,184 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-10-12 00:22:53,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:22:53,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:22:53,185 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 9, 9, 1, 1, 1, 1] [2024-10-12 00:22:53,185 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:22:53,186 INFO L745 eck$LassoCheckResult]: Stem: 607#$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(17, 2); 600#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem9#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short10#1, main_#t~post11#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~k~0#1, 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);havoc main_~k~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 594#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 595#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 596#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 597#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 608#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 643#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 641#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 639#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 637#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 635#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 633#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 631#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 629#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 627#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 625#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 623#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 621#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 619#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 617#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 615#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 614#L21-3 assume !(main_~i~0#1 < 100000); 609#L21-4 main_~i~0#1 := 0; 610#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 606#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 603#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 604#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 611#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 653#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 652#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 651#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 650#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 649#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 648#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 647#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 646#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 645#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 644#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 642#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 640#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 638#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 636#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 634#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 632#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 630#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 628#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 626#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 624#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 622#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 620#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 618#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 613#L28 [2024-10-12 00:22:53,186 INFO L747 eck$LassoCheckResult]: Loop: 613#L28 assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;call write~int#1(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 616#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 612#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 613#L28 [2024-10-12 00:22:53,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:53,186 INFO L85 PathProgramCache]: Analyzing trace with hash 403223997, now seen corresponding path program 2 times [2024-10-12 00:22:53,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:53,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416612731] [2024-10-12 00:22:53,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:53,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:53,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:22:53,520 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-10-12 00:22:53,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:22:53,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416612731] [2024-10-12 00:22:53,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416612731] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:22:53,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948493220] [2024-10-12 00:22:53,521 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:22:53,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:22:53,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:53,524 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:53,527 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:22:53,646 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 00:22:53,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:22:53,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-12 00:22:53,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:22:53,724 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-10-12 00:22:53,724 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:22:53,962 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-10-12 00:22:53,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948493220] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:22:53,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:22:53,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-10-12 00:22:53,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646257512] [2024-10-12 00:22:53,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:22:53,963 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:22:53,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:53,964 INFO L85 PathProgramCache]: Analyzing trace with hash 56723, now seen corresponding path program 4 times [2024-10-12 00:22:53,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:53,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919450280] [2024-10-12 00:22:53,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:53,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 00:22:53,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [789247069] [2024-10-12 00:22:53,972 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-12 00:22:53,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:22:53,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:53,976 INFO L229 MonitoredProcess]: Starting monitored process 24 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,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-10-12 00:22:54,033 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-12 00:22:54,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-12 00:22:54,034 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:22:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:22:54,041 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:22:54,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:22:54,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-12 00:22:54,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-10-12 00:22:54,182 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. cyclomatic complexity: 16 Second operand has 25 states, 25 states have (on average 2.08) internal successors, (52), 25 states have internal predecessors, (52), 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,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:22:54,570 INFO L93 Difference]: Finished difference Result 249 states and 295 transitions. [2024-10-12 00:22:54,570 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 249 states and 295 transitions. [2024-10-12 00:22:54,572 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-10-12 00:22:54,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 249 states to 249 states and 295 transitions. [2024-10-12 00:22:54,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 205 [2024-10-12 00:22:54,581 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 205 [2024-10-12 00:22:54,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 249 states and 295 transitions. [2024-10-12 00:22:54,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:22:54,582 INFO L218 hiAutomatonCegarLoop]: Abstraction has 249 states and 295 transitions. [2024-10-12 00:22:54,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states and 295 transitions. [2024-10-12 00:22:54,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 122. [2024-10-12 00:22:54,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 122 states have (on average 1.2049180327868851) internal successors, (147), 121 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:22:54,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 147 transitions. [2024-10-12 00:22:54,600 INFO L240 hiAutomatonCegarLoop]: Abstraction has 122 states and 147 transitions. [2024-10-12 00:22:54,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-12 00:22:54,607 INFO L425 stractBuchiCegarLoop]: Abstraction has 122 states and 147 transitions. [2024-10-12 00:22:54,607 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-12 00:22:54,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 147 transitions. [2024-10-12 00:22:54,608 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-10-12 00:22:54,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:22:54,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:22:54,617 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 22, 21, 21, 1, 1, 1, 1] [2024-10-12 00:22:54,617 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:22:54,617 INFO L745 eck$LassoCheckResult]: Stem: 1253#$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(17, 2); 1245#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem9#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short10#1, main_#t~post11#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~k~0#1, 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);havoc main_~k~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 1237#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1238#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1239#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1240#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1338#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1336#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1334#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1332#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1330#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1328#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1326#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1324#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1322#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1320#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1318#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1316#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1314#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1312#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1310#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1308#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1306#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1304#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1302#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1300#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1298#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1296#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1294#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1292#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1290#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1288#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1286#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1284#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1282#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1280#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1278#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1276#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1274#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1272#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1270#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1268#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1266#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1264#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1262#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1260#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1259#L21-3 assume !(main_~i~0#1 < 100000); 1254#L21-4 main_~i~0#1 := 0; 1255#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1256#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1248#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1249#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1251#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1252#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1358#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1357#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1356#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1355#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1354#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1353#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1352#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1351#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1350#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1349#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1348#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1347#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1346#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1345#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1344#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1343#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1342#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1341#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1340#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1339#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1337#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1335#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1333#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1331#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1329#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1327#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1325#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1323#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1321#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1319#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1317#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1315#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1313#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1311#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1309#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1307#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1305#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1303#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1301#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1299#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1297#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1295#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1293#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1291#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1289#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1287#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1285#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1283#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1281#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1279#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1277#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1275#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1273#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1271#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1269#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1267#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1265#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1263#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1258#L28 [2024-10-12 00:22:54,618 INFO L747 eck$LassoCheckResult]: Loop: 1258#L28 assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;call write~int#1(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1261#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1257#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 1258#L28 [2024-10-12 00:22:54,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:22:54,618 INFO L85 PathProgramCache]: Analyzing trace with hash 615339989, now seen corresponding path program 3 times [2024-10-12 00:22:54,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:22:54,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473170842] [2024-10-12 00:22:54,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:22:54,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:22:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:22:55,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2024-10-12 00:22:55,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:22:55,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473170842] [2024-10-12 00:22:55,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473170842] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:22:55,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778876192] [2024-10-12 00:22:55,720 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 00:22:55,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:22:55,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:22:55,730 INFO L229 MonitoredProcess]: Starting monitored process 25 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:55,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-10-12 00:23:02,160 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2024-10-12 00:23:02,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:23:02,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-12 00:23:02,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:23:02,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2024-10-12 00:23:02,304 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:23:03,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2024-10-12 00:23:03,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778876192] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:23:03,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:23:03,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2024-10-12 00:23:03,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794577807] [2024-10-12 00:23:03,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:23:03,060 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:23:03,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:03,061 INFO L85 PathProgramCache]: Analyzing trace with hash 56723, now seen corresponding path program 5 times [2024-10-12 00:23:03,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:03,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891895118] [2024-10-12 00:23:03,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:03,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 00:23:03,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [228698300] [2024-10-12 00:23:03,071 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-12 00:23:03,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:23:03,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:03,074 INFO L229 MonitoredProcess]: Starting monitored process 26 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:23:03,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-10-12 00:23:03,127 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-12 00:23:03,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-12 00:23:03,127 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:23:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:03,135 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:23:03,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:23:03,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-10-12 00:23:03,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2024-10-12 00:23:03,271 INFO L87 Difference]: Start difference. First operand 122 states and 147 transitions. cyclomatic complexity: 28 Second operand has 49 states, 49 states have (on average 2.0408163265306123) internal successors, (100), 49 states have internal predecessors, (100), 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:23:04,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:23:04,256 INFO L93 Difference]: Finished difference Result 513 states and 607 transitions. [2024-10-12 00:23:04,256 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 513 states and 607 transitions. [2024-10-12 00:23:04,263 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-10-12 00:23:04,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 513 states to 513 states and 607 transitions. [2024-10-12 00:23:04,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 421 [2024-10-12 00:23:04,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 421 [2024-10-12 00:23:04,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 513 states and 607 transitions. [2024-10-12 00:23:04,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:23:04,276 INFO L218 hiAutomatonCegarLoop]: Abstraction has 513 states and 607 transitions. [2024-10-12 00:23:04,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states and 607 transitions. [2024-10-12 00:23:04,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 242. [2024-10-12 00:23:04,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 242 states have (on average 1.2024793388429753) internal successors, (291), 241 states have internal predecessors, (291), 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:23:04,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 291 transitions. [2024-10-12 00:23:04,307 INFO L240 hiAutomatonCegarLoop]: Abstraction has 242 states and 291 transitions. [2024-10-12 00:23:04,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-10-12 00:23:04,310 INFO L425 stractBuchiCegarLoop]: Abstraction has 242 states and 291 transitions. [2024-10-12 00:23:04,310 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-12 00:23:04,310 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 242 states and 291 transitions. [2024-10-12 00:23:04,312 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-10-12 00:23:04,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:23:04,315 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:23:04,322 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 46, 46, 45, 45, 1, 1, 1, 1] [2024-10-12 00:23:04,322 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:23:04,323 INFO L745 eck$LassoCheckResult]: Stem: 2606#$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(17, 2); 2598#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem9#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short10#1, main_#t~post11#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~k~0#1, 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);havoc main_~k~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 2590#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2591#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2592#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2593#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2787#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2785#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2783#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2781#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2779#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2777#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2775#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2773#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2771#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2769#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2767#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2765#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2763#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2761#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2759#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2757#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2755#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2753#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2751#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2749#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2747#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2745#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2743#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2741#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2739#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2737#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2735#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2733#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2731#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2729#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2727#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2725#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2723#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2721#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2719#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2717#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2715#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2713#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2711#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2709#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2707#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2705#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2703#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2701#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2699#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2697#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2695#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2693#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2691#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2689#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2687#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2685#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2683#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2681#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2679#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2677#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2675#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2673#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2671#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2669#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2667#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2665#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2663#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2661#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2659#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2657#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2655#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2653#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2651#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2649#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2647#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2645#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2643#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2641#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2639#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2637#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2635#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2633#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2631#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2629#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2627#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2625#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2623#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2621#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2619#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2617#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2615#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2613#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2612#L21-3 assume !(main_~i~0#1 < 100000); 2607#L21-4 main_~i~0#1 := 0; 2608#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2609#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2601#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2602#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2604#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2605#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2831#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2830#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2829#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2828#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2827#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2826#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2825#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2824#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2823#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2822#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2821#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2820#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2819#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2818#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2817#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2816#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2815#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2814#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2813#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2812#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2811#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2810#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2809#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2808#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2807#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2806#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2805#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2804#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2803#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2802#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2801#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2800#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2799#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2798#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2797#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2796#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2795#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2794#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2793#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2792#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2791#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2790#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2789#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2788#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2786#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2784#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2782#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2780#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2778#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2776#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2774#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2772#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2770#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2768#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2766#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2764#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2762#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2760#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2758#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2756#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2754#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2752#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2750#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2748#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2746#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2744#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2742#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2740#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2738#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2736#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2734#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2732#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2730#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2728#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2726#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2724#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2722#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2720#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2718#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2716#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2714#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2712#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2710#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2708#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2706#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2704#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2702#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2700#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2698#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2696#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2694#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2692#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2690#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2688#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2686#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2684#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2682#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2680#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2678#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2676#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2674#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2672#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2670#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2668#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2666#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2664#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2662#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2660#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2658#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2656#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2654#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2652#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2650#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2648#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2646#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2644#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2642#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2640#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2638#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2636#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2634#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2632#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2630#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2628#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2626#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2624#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2622#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2620#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2618#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2616#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2611#L28 [2024-10-12 00:23:04,329 INFO L747 eck$LassoCheckResult]: Loop: 2611#L28 assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;call write~int#1(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2614#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2610#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 2611#L28 [2024-10-12 00:23:04,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:04,330 INFO L85 PathProgramCache]: Analyzing trace with hash 982432773, now seen corresponding path program 4 times [2024-10-12 00:23:04,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:04,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198279224] [2024-10-12 00:23:04,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:04,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:23:07,770 INFO L134 CoverageAnalysis]: Checked inductivity of 5131 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 3015 trivial. 0 not checked. [2024-10-12 00:23:07,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:23:07,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198279224] [2024-10-12 00:23:07,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198279224] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:23:07,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298943443] [2024-10-12 00:23:07,771 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-12 00:23:07,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:23:07,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:07,774 INFO L229 MonitoredProcess]: Starting monitored process 27 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:23:07,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-10-12 00:23:08,054 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-12 00:23:08,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:23:08,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 1144 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-12 00:23:08,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:23:08,245 INFO L134 CoverageAnalysis]: Checked inductivity of 5131 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 3015 trivial. 0 not checked. [2024-10-12 00:23:08,245 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:23:10,862 INFO L134 CoverageAnalysis]: Checked inductivity of 5131 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 3015 trivial. 0 not checked. [2024-10-12 00:23:10,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298943443] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:23:10,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:23:10,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2024-10-12 00:23:10,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398224644] [2024-10-12 00:23:10,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:23:10,863 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:23:10,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:10,867 INFO L85 PathProgramCache]: Analyzing trace with hash 56723, now seen corresponding path program 6 times [2024-10-12 00:23:10,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:10,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338406111] [2024-10-12 00:23:10,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:10,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 00:23:10,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1894252499] [2024-10-12 00:23:10,877 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-12 00:23:10,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:23:10,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:10,883 INFO L229 MonitoredProcess]: Starting monitored process 28 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:23:10,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-10-12 00:23:10,954 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-10-12 00:23:10,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-12 00:23:10,954 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:23:10,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:10,961 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:23:11,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:23:11,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2024-10-12 00:23:11,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2024-10-12 00:23:11,066 INFO L87 Difference]: Start difference. First operand 242 states and 291 transitions. cyclomatic complexity: 52 Second operand has 97 states, 97 states have (on average 2.020618556701031) internal successors, (196), 97 states have internal predecessors, (196), 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:23:15,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:23:15,110 INFO L93 Difference]: Finished difference Result 1041 states and 1231 transitions. [2024-10-12 00:23:15,110 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1041 states and 1231 transitions. [2024-10-12 00:23:15,116 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-10-12 00:23:15,119 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1041 states to 1041 states and 1231 transitions. [2024-10-12 00:23:15,119 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 853 [2024-10-12 00:23:15,119 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 853 [2024-10-12 00:23:15,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1041 states and 1231 transitions. [2024-10-12 00:23:15,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:23:15,120 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1041 states and 1231 transitions. [2024-10-12 00:23:15,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states and 1231 transitions. [2024-10-12 00:23:15,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 482. [2024-10-12 00:23:15,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 482 states have (on average 1.2012448132780082) internal successors, (579), 481 states have internal predecessors, (579), 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:23:15,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 579 transitions. [2024-10-12 00:23:15,132 INFO L240 hiAutomatonCegarLoop]: Abstraction has 482 states and 579 transitions. [2024-10-12 00:23:15,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-10-12 00:23:15,133 INFO L425 stractBuchiCegarLoop]: Abstraction has 482 states and 579 transitions. [2024-10-12 00:23:15,133 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-12 00:23:15,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 482 states and 579 transitions. [2024-10-12 00:23:15,135 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-10-12 00:23:15,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:23:15,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:23:15,140 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [94, 94, 94, 93, 93, 1, 1, 1, 1] [2024-10-12 00:23:15,140 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:23:15,140 INFO L745 eck$LassoCheckResult]: Stem: 5375#$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(17, 2); 5367#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem9#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short10#1, main_#t~post11#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~k~0#1, 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);havoc main_~k~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 5359#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5360#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5361#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5362#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5748#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5746#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5744#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5742#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5740#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5738#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5736#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5734#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5732#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5730#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5728#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5726#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5724#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5722#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5720#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5718#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5716#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5714#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5712#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5710#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5708#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5706#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5704#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5702#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5700#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5698#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5696#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5694#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5692#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5690#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5688#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5686#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5684#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5682#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5680#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5678#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5676#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5674#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5672#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5670#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5668#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5666#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5664#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5662#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5660#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5658#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5656#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5654#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5652#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5650#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5648#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5646#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5644#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5642#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5640#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5638#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5636#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5634#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5632#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5630#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5628#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5626#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5624#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5622#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5620#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5618#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5616#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5614#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5612#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5610#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5608#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5606#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5604#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5602#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5600#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5598#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5596#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5594#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5592#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5590#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5588#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5586#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5584#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5582#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5580#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5578#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5576#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5574#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5572#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5570#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5568#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5566#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5564#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5562#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5560#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5558#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5556#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5554#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5552#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5550#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5548#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5546#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5544#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5542#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5540#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5538#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5536#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5534#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5532#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5530#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5528#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5526#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5524#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5522#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5520#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5518#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5516#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5514#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5512#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5510#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5508#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5506#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5504#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5502#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5500#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5498#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5496#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5494#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5492#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5490#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5488#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5486#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5484#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5482#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5480#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5478#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5476#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5474#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5472#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5470#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5468#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5466#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5464#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5462#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5460#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5458#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5456#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5454#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5452#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5450#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5448#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5446#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5444#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5442#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5440#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5438#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5436#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5434#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5432#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5430#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5428#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5426#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5424#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5422#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5420#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5418#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5416#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5414#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5412#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5410#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5408#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5406#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5404#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5402#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5400#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5398#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5396#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5394#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5392#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5390#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5388#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5386#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5384#L21-3 assume !!(main_~i~0#1 < 100000);call write~int#1(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~i~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5382#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 5381#L21-3 assume !(main_~i~0#1 < 100000); 5376#L21-4 main_~i~0#1 := 0; 5377#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5378#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5370#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5371#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5373#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5374#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5840#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5839#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5838#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5837#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5836#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5835#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5834#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5833#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5832#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5831#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5830#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5829#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5828#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5827#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5826#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5825#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5824#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5823#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5822#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5821#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5820#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5819#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5818#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5817#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5816#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5815#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5814#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5813#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5812#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5811#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5810#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5809#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5808#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5807#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5806#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5805#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5804#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5803#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5802#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5801#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5800#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5799#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5798#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5797#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5796#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5795#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5794#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5793#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5792#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5791#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5790#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5789#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5788#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5787#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5786#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5785#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5784#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5783#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5782#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5781#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5780#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5779#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5778#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5777#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5776#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5775#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5774#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5773#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5772#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5771#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5770#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5769#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5768#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5767#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5766#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5765#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5764#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5763#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5762#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5761#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5760#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5759#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5758#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5757#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5756#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5755#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5754#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5753#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5752#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5751#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5750#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5749#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5747#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5745#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5743#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5741#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5739#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5737#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5735#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5733#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5731#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5729#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5727#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5725#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5723#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5721#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5719#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5717#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5715#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5713#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5711#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5709#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5707#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5705#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5703#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5701#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5699#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5697#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5695#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5693#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5691#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5689#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5687#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5685#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5683#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5681#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5679#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5677#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5675#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5673#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5671#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5669#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5667#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5665#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5663#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5661#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5659#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5657#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5655#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5653#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5651#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5649#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5647#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5645#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5643#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5641#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5639#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5637#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5635#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5633#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5631#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5629#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5627#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5625#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5623#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5621#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5619#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5617#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5615#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5613#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5611#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5609#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5607#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5605#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5603#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5601#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5599#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5597#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5595#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5593#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5591#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5589#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5587#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5585#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5583#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5581#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5579#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5577#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5575#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5573#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5571#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5569#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5567#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5565#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5563#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5561#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5559#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5557#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5555#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5553#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5551#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5549#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5547#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5545#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5543#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5541#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5539#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5537#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5535#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5533#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5531#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5529#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5527#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5525#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5523#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5521#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5519#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5517#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5515#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5513#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5511#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5509#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5507#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5505#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5503#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5501#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5499#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5497#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5495#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5493#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5491#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5489#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5487#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5485#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5483#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5481#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5479#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5477#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5475#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5473#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5471#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5469#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5467#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5465#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5463#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5461#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5459#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5457#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5455#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5453#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5451#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5449#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5447#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5445#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5443#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5441#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5439#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5437#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5435#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5433#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5431#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5429#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5427#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5425#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5423#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5421#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5419#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5417#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5415#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5413#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5411#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5409#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5407#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5405#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5403#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5401#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5399#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5397#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5395#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5393#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5391#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5389#L28 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 5387#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5385#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5380#L28 [2024-10-12 00:23:15,141 INFO L747 eck$LassoCheckResult]: Loop: 5380#L28 assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;call write~int#1(main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int#2(main_~k~0#1 * main_~k~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5383#L26-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5379#L26-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1; 5380#L28 [2024-10-12 00:23:15,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:15,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1696203877, now seen corresponding path program 5 times [2024-10-12 00:23:15,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:15,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607295195] [2024-10-12 00:23:15,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:15,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:15,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:23:23,031 INFO L134 CoverageAnalysis]: Checked inductivity of 21763 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 12927 trivial. 0 not checked. [2024-10-12 00:23:23,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:23:23,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607295195] [2024-10-12 00:23:23,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607295195] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:23:23,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146681476] [2024-10-12 00:23:23,032 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-12 00:23:23,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:23:23,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:23,034 INFO L229 MonitoredProcess]: Starting monitored process 29 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:23:23,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process