./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC --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 0286582125bb2879636b8cf3b934bed172850a3a3b0d880c07306d10439134a7 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-23 23:52:42,205 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 23:52:42,302 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-23 23:52:42,307 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 23:52:42,307 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 23:52:42,333 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 23:52:42,334 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 23:52:42,334 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 23:52:42,334 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 23:52:42,334 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 23:52:42,335 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 23:52:42,335 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 23:52:42,335 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 23:52:42,335 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-23 23:52:42,335 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-23 23:52:42,335 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-23 23:52:42,335 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-23 23:52:42,335 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-23 23:52:42,335 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-23 23:52:42,335 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 23:52:42,336 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-23 23:52:42,336 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 23:52:42,336 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 23:52:42,336 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 23:52:42,336 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 23:52:42,336 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-23 23:52:42,336 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-23 23:52:42,336 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-23 23:52:42,336 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-23 23:52:42,336 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 23:52:42,336 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 23:52:42,337 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-23 23:52:42,337 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-23 23:52:42,337 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 23:52:42,337 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 23:52:42,337 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:52:42,337 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 23:52:42,337 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL_NO_AM [2024-11-23 23:52:42,337 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-23 23:52:42,338 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC 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 -> 0286582125bb2879636b8cf3b934bed172850a3a3b0d880c07306d10439134a7 [2024-11-23 23:52:42,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 23:52:42,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 23:52:42,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 23:52:42,615 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 23:52:42,615 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 23:52:42,616 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2024-11-23 23:52:45,615 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/data/e45bf9389/95d61404223848bd9fe16e4b267a96ae/FLAGee45b5269 [2024-11-23 23:52:45,873 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 23:52:45,873 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2024-11-23 23:52:45,882 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/data/e45bf9389/95d61404223848bd9fe16e4b267a96ae/FLAGee45b5269 [2024-11-23 23:52:46,187 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/data/e45bf9389/95d61404223848bd9fe16e4b267a96ae [2024-11-23 23:52:46,192 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 23:52:46,194 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 23:52:46,197 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 23:52:46,198 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 23:52:46,203 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 23:52:46,206 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:52:46" (1/1) ... [2024-11-23 23:52:46,207 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e9c5f21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:46, skipping insertion in model container [2024-11-23 23:52:46,208 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:52:46" (1/1) ... [2024-11-23 23:52:46,228 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 23:52:46,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:52:46,477 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 23:52:46,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:52:46,530 INFO L204 MainTranslator]: Completed translation [2024-11-23 23:52:46,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:46 WrapperNode [2024-11-23 23:52:46,531 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 23:52:46,532 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 23:52:46,532 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 23:52:46,532 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 23:52:46,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:46" (1/1) ... [2024-11-23 23:52:46,552 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:46" (1/1) ... [2024-11-23 23:52:46,574 INFO L138 Inliner]: procedures = 18, calls = 30, calls flagged for inlining = 8, calls inlined = 10, statements flattened = 166 [2024-11-23 23:52:46,575 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 23:52:46,576 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 23:52:46,576 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 23:52:46,576 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 23:52:46,586 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:46" (1/1) ... [2024-11-23 23:52:46,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:46" (1/1) ... [2024-11-23 23:52:46,588 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:46" (1/1) ... [2024-11-23 23:52:46,620 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 3, 9]. 64 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 1, 2]. [2024-11-23 23:52:46,620 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:46" (1/1) ... [2024-11-23 23:52:46,620 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:46" (1/1) ... [2024-11-23 23:52:46,632 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:46" (1/1) ... [2024-11-23 23:52:46,633 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:46" (1/1) ... [2024-11-23 23:52:46,643 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:46" (1/1) ... [2024-11-23 23:52:46,644 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:46" (1/1) ... [2024-11-23 23:52:46,645 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:46" (1/1) ... [2024-11-23 23:52:46,648 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 23:52:46,649 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 23:52:46,649 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 23:52:46,649 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 23:52:46,650 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:46" (1/1) ... [2024-11-23 23:52:46,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 23:52:46,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:46,687 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 23:52:46,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-23 23:52:46,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 23:52:46,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-23 23:52:46,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-23 23:52:46,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-23 23:52:46,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-23 23:52:46,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-23 23:52:46,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-23 23:52:46,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-23 23:52:46,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 23:52:46,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 23:52:46,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-23 23:52:46,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-23 23:52:46,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-23 23:52:46,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-23 23:52:46,831 INFO L234 CfgBuilder]: Building ICFG [2024-11-23 23:52:46,833 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 23:52:47,215 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-11-23 23:52:47,215 INFO L283 CfgBuilder]: Performing block encoding [2024-11-23 23:52:47,225 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 23:52:47,226 INFO L312 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-23 23:52:47,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:52:47 BoogieIcfgContainer [2024-11-23 23:52:47,226 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 23:52:47,227 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-23 23:52:47,227 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-23 23:52:47,232 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-23 23:52:47,232 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 23:52:47,233 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 11:52:46" (1/3) ... [2024-11-23 23:52:47,234 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@43912ac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 11:52:47, skipping insertion in model container [2024-11-23 23:52:47,234 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 23:52:47,234 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:52:46" (2/3) ... [2024-11-23 23:52:47,234 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@43912ac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 11:52:47, skipping insertion in model container [2024-11-23 23:52:47,234 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 23:52:47,234 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:52:47" (3/3) ... [2024-11-23 23:52:47,236 INFO L363 chiAutomizerObserver]: Analyzing ICFG data_structures_set_multi_proc_trivial_ground.i [2024-11-23 23:52:47,288 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-23 23:52:47,288 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-23 23:52:47,288 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-23 23:52:47,288 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-23 23:52:47,288 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-23 23:52:47,288 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-23 23:52:47,289 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-23 23:52:47,289 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-23 23:52:47,294 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 55 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 54 states have internal predecessors, (82), 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-11-23 23:52:47,311 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 45 [2024-11-23 23:52:47,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 23:52:47,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 23:52:47,317 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 23:52:47,317 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-23 23:52:47,317 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-23 23:52:47,317 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 55 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 54 states have internal predecessors, (82), 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-11-23 23:52:47,320 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 45 [2024-11-23 23:52:47,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 23:52:47,320 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 23:52:47,321 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 23:52:47,321 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-23 23:52:47,327 INFO L747 eck$LassoCheckResult]: Stem: "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(48, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0;" [2024-11-23 23:52:47,328 INFO L749 eck$LassoCheckResult]: Loop: "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" [2024-11-23 23:52:47,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:52:47,332 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-23 23:52:47,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-23 23:52:47,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509948223] [2024-11-23 23:52:47,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:52:47,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:52:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:52:47,416 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 23:52:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:52:47,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-23 23:52:47,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:52:47,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1221, now seen corresponding path program 1 times [2024-11-23 23:52:47,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-23 23:52:47,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232720608] [2024-11-23 23:52:47,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:52:47,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:52:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:52:47,457 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 23:52:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:52:47,464 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-23 23:52:47,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:52:47,466 INFO L85 PathProgramCache]: Analyzing trace with hash 925703, now seen corresponding path program 1 times [2024-11-23 23:52:47,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-23 23:52:47,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419707584] [2024-11-23 23:52:47,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:52:47,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:52:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:52:47,486 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 23:52:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:52:47,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-23 23:52:47,996 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 23:52:48,000 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 23:52:48,000 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 23:52:48,000 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 23:52:48,000 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 23:52:48,001 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 23:52:48,001 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 23:52:48,001 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 23:52:48,001 INFO L132 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_ground.i_Iteration1_Lasso [2024-11-23 23:52:48,001 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 23:52:48,001 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 23:52:48,024 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 23:52:48,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 23:52:48,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 23:52:48,042 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 23:52:48,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 23:52:48,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 23:52:48,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 23:52:48,058 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 23:52:48,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 23:52:48,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 23:52:48,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 23:52:48,075 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 23:52:48,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 23:52:48,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 23:52:48,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 23:52:48,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 23:52:48,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 23:52:48,325 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 23:52:48,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 23:52:48,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 23:52:48,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 23:52:48,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 23:52:48,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 23:52:48,347 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 23:52:48,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 23:52:48,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 23:52:48,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 23:52:48,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 23:52:48,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 23:52:48,694 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 23:52:48,698 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 23:52:48,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 23:52:48,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:48,702 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 23:52:48,707 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-11-23 23:52:48,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-23 23:52:48,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 23:52:48,724 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 23:52:48,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 23:52:48,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 23:52:48,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 23:52:48,736 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 23:52:48,736 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 23:52:48,740 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 23:52:48,750 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-11-23 23:52:48,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 23:52:48,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:48,752 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 23:52:48,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-23 23:52:48,755 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-11-23 23:52:48,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 23:52:48,767 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 23:52:48,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 23:52:48,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 23:52:48,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 23:52:48,768 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 23:52:48,768 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 23:52:48,772 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 23:52:48,777 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-23 23:52:48,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 23:52:48,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:48,779 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 23:52:48,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-23 23:52:48,782 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-11-23 23:52:48,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 23:52:48,795 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 23:52:48,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 23:52:48,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 23:52:48,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 23:52:48,796 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 23:52:48,796 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 23:52:48,798 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 23:52:48,805 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-23 23:52:48,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 23:52:48,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:48,808 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 23:52:48,809 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-23 23:52:48,810 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-11-23 23:52:48,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 23:52:48,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 23:52:48,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 23:52:48,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 23:52:48,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 23:52:48,822 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 23:52:48,822 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 23:52:48,824 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 23:52:48,833 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-23 23:52:48,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 23:52:48,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:48,835 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 23:52:48,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-23 23:52:48,842 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-11-23 23:52:48,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 23:52:48,856 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 23:52:48,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 23:52:48,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 23:52:48,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 23:52:48,858 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 23:52:48,858 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 23:52:48,860 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 23:52:48,869 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-11-23 23:52:48,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 23:52:48,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:48,874 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 23:52:48,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-23 23:52:48,878 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-11-23 23:52:48,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 23:52:48,893 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 23:52:48,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 23:52:48,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 23:52:48,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 23:52:48,894 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 23:52:48,895 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 23:52:48,898 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 23:52:48,908 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-23 23:52:48,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 23:52:48,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:48,912 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 23:52:48,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-23 23:52:48,916 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-11-23 23:52:48,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 23:52:48,931 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 23:52:48,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 23:52:48,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 23:52:48,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 23:52:48,932 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 23:52:48,932 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 23:52:48,935 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 23:52:48,945 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-23 23:52:48,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 23:52:48,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:48,947 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 23:52:48,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-23 23:52:48,952 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-11-23 23:52:48,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 23:52:48,966 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 23:52:48,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 23:52:48,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 23:52:48,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 23:52:48,967 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 23:52:48,967 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 23:52:48,969 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 23:52:48,979 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-11-23 23:52:48,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 23:52:48,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:48,982 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 23:52:48,985 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-23 23:52:48,986 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-11-23 23:52:49,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 23:52:49,002 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 23:52:49,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 23:52:49,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 23:52:49,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 23:52:49,003 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 23:52:49,003 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 23:52:49,007 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 23:52:49,014 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-11-23 23:52:49,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 23:52:49,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:49,016 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 23:52:49,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-23 23:52:49,019 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-11-23 23:52:49,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 23:52:49,034 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 23:52:49,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 23:52:49,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 23:52:49,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 23:52:49,035 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 23:52:49,036 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 23:52:49,039 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 23:52:49,049 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-23 23:52:49,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 23:52:49,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:49,051 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 23:52:49,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-23 23:52:49,056 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-11-23 23:52:49,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 23:52:49,071 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 23:52:49,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 23:52:49,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 23:52:49,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 23:52:49,072 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 23:52:49,072 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 23:52:49,074 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 23:52:49,084 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-23 23:52:49,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 23:52:49,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:49,088 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 23:52:49,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-23 23:52:49,092 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-11-23 23:52:49,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 23:52:49,108 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 23:52:49,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 23:52:49,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 23:52:49,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 23:52:49,109 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 23:52:49,109 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 23:52:49,113 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 23:52:49,122 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-23 23:52:49,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 23:52:49,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:49,125 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 23:52:49,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-23 23:52:49,129 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-11-23 23:52:49,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 23:52:49,142 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 23:52:49,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 23:52:49,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 23:52:49,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 23:52:49,143 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 23:52:49,143 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 23:52:49,145 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 23:52:49,152 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-23 23:52:49,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 23:52:49,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:49,154 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 23:52:49,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-23 23:52:49,157 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-11-23 23:52:49,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 23:52:49,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 23:52:49,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 23:52:49,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 23:52:49,175 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 23:52:49,176 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 23:52:49,181 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 23:52:49,191 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-23 23:52:49,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 23:52:49,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:49,193 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 23:52:49,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-23 23:52:49,236 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-11-23 23:52:49,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 23:52:49,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 23:52:49,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 23:52:49,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 23:52:49,255 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 23:52:49,255 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 23:52:49,259 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 23:52:49,269 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-23 23:52:49,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 23:52:49,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:49,271 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 23:52:49,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-23 23:52:49,276 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-11-23 23:52:49,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 23:52:49,291 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 23:52:49,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 23:52:49,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 23:52:49,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 23:52:49,292 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 23:52:49,292 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 23:52:49,295 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 23:52:49,301 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-11-23 23:52:49,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 23:52:49,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:49,303 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 23:52:49,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-23 23:52:49,306 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-11-23 23:52:49,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 23:52:49,317 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 23:52:49,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 23:52:49,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 23:52:49,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 23:52:49,318 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 23:52:49,318 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 23:52:49,322 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 23:52:49,332 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-23 23:52:49,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 23:52:49,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:49,335 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 23:52:49,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-23 23:52:49,340 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-11-23 23:52:49,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 23:52:49,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 23:52:49,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 23:52:49,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 23:52:49,354 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 23:52:49,354 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 23:52:49,360 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 23:52:49,369 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-23 23:52:49,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 23:52:49,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:49,372 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 23:52:49,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-23 23:52:49,376 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-11-23 23:52:49,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 23:52:49,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 23:52:49,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 23:52:49,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 23:52:49,395 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 23:52:49,395 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 23:52:49,401 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 23:52:49,410 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-23 23:52:49,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 23:52:49,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:49,413 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 23:52:49,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-23 23:52:49,418 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 23:52:49,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 23:52:49,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 23:52:49,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 23:52:49,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 23:52:49,435 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 23:52:49,435 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 23:52:49,440 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 23:52:49,449 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-23 23:52:49,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 23:52:49,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:49,451 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 23:52:49,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-23 23:52:49,454 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-11-23 23:52:49,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 23:52:49,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 23:52:49,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 23:52:49,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 23:52:49,468 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 23:52:49,468 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 23:52:49,473 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 23:52:49,483 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-23 23:52:49,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 23:52:49,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:49,486 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 23:52:49,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-23 23:52:49,490 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-11-23 23:52:49,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 23:52:49,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 23:52:49,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 23:52:49,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 23:52:49,511 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 23:52:49,511 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 23:52:49,521 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 23:52:49,584 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2024-11-23 23:52:49,588 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-23 23:52:49,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 23:52:49,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:49,595 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 23:52:49,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-23 23:52:49,597 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 23:52:49,613 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-23 23:52:49,613 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 23:52:49,613 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#set~0#1.base)_1, ULTIMATE.start_main_~x~0#1) = 199999*v_rep(select #length ULTIMATE.start_main_~#set~0#1.base)_1 - 8*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2024-11-23 23:52:49,623 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-23 23:52:49,651 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2024-11-23 23:52:49,667 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-23 23:52:49,668 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-23 23:52:49,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:52:49,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:52:49,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 23:52:49,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:52:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:52:49,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-23 23:52:49,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:52:49,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:52:49,825 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-11-23 23:52:49,828 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 55 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 54 states have internal predecessors, (82), 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-11-23 23:52:49,909 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 55 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 54 states have internal predecessors, (82), 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 108 states and 163 transitions. Complement of second has 6 states. [2024-11-23 23:52:49,912 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-11-23 23:52:49,917 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-11-23 23:52:49,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2024-11-23 23:52:49,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 2 letters. Loop has 2 letters. [2024-11-23 23:52:49,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 23:52:49,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-23 23:52:49,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 23:52:49,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-23 23:52:49,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 23:52:49,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 163 transitions. [2024-11-23 23:52:49,939 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 43 [2024-11-23 23:52:49,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 52 states and 78 transitions. [2024-11-23 23:52:49,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2024-11-23 23:52:49,949 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2024-11-23 23:52:49,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 78 transitions. [2024-11-23 23:52:49,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 23:52:49,952 INFO L218 hiAutomatonCegarLoop]: Abstraction has 52 states and 78 transitions. [2024-11-23 23:52:49,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 78 transitions. [2024-11-23 23:52:49,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-23 23:52:49,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.5) internal successors, (78), 51 states have internal predecessors, (78), 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-11-23 23:52:49,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 78 transitions. [2024-11-23 23:52:49,986 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 78 transitions. [2024-11-23 23:52:49,986 INFO L425 stractBuchiCegarLoop]: Abstraction has 52 states and 78 transitions. [2024-11-23 23:52:49,986 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-23 23:52:49,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 78 transitions. [2024-11-23 23:52:49,987 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 43 [2024-11-23 23:52:49,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 23:52:49,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 23:52:49,988 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-23 23:52:49,990 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-23 23:52:49,990 INFO L747 eck$LassoCheckResult]: Stem: "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(48, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0;" "assume !(main_~x~0#1 < 100000);" "main_~x~0#1 := 0;" [2024-11-23 23:52:49,990 INFO L749 eck$LassoCheckResult]: Loop: "assume main_~x~0#1 < main_~n~0#1;" "main_~y~0#1 := 1 + main_~x~0#1;" "assume !(main_~y~0#1 < main_~n~0#1);" "main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" [2024-11-23 23:52:49,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:52:49,991 INFO L85 PathProgramCache]: Analyzing trace with hash 925769, now seen corresponding path program 1 times [2024-11-23 23:52:49,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-23 23:52:49,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404654225] [2024-11-23 23:52:49,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:52:49,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:52:50,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:52:50,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-23 23:52:50,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404654225] [2024-11-23 23:52:50,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404654225] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:52:50,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739571966] [2024-11-23 23:52:50,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:52:50,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:52:50,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:50,062 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:52:50,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-23 23:52:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:52:50,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 23:52:50,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:52:50,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:52:50,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739571966] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:52:50,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:52:50,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-11-23 23:52:50,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378430942] [2024-11-23 23:52:50,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:52:50,142 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-23 23:52:50,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:52:50,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1605019, now seen corresponding path program 1 times [2024-11-23 23:52:50,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-23 23:52:50,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092032868] [2024-11-23 23:52:50,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:52:50,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:52:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:52:50,153 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 23:52:50,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:52:50,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-23 23:52:50,191 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 23:52:50,191 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 23:52:50,191 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 23:52:50,192 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 23:52:50,192 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-23 23:52:50,192 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 23:52:50,192 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 23:52:50,192 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 23:52:50,192 INFO L132 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_ground.i_Iteration2_Loop [2024-11-23 23:52:50,192 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 23:52:50,192 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 23:52:50,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 23:52:50,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 23:52:50,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 23:52:50,234 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 23:52:50,235 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-23 23:52:50,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 23:52:50,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:50,241 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 23:52:50,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-23 23:52:50,244 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 23:52:50,244 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 23:52:50,270 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-11-23 23:52:50,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 23:52:50,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:50,272 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 23:52:50,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-23 23:52:50,276 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-23 23:52:50,276 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 23:52:50,381 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-23 23:52:50,385 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-11-23 23:52:50,385 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 23:52:50,385 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 23:52:50,385 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 23:52:50,385 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 23:52:50,385 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 23:52:50,385 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 23:52:50,385 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 23:52:50,386 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 23:52:50,386 INFO L132 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_ground.i_Iteration2_Loop [2024-11-23 23:52:50,386 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 23:52:50,386 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 23:52:50,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 23:52:50,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 23:52:50,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 23:52:50,431 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 23:52:50,432 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 23:52:50,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 23:52:50,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:50,438 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 23:52:50,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-23 23:52:50,440 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-11-23 23:52:50,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 23:52:50,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 23:52:50,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 23:52:50,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 23:52:50,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 23:52:50,455 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 23:52:50,455 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 23:52:50,456 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 23:52:50,462 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-23 23:52:50,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 23:52:50,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:50,464 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 23:52:50,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-23 23:52:50,466 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-11-23 23:52:50,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 23:52:50,478 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 23:52:50,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 23:52:50,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 23:52:50,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 23:52:50,478 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 23:52:50,478 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 23:52:50,480 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 23:52:50,486 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-11-23 23:52:50,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 23:52:50,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:50,488 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 23:52:50,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-23 23:52:50,491 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-11-23 23:52:50,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 23:52:50,502 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 23:52:50,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 23:52:50,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 23:52:50,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 23:52:50,504 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 23:52:50,504 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 23:52:50,507 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 23:52:50,511 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-11-23 23:52:50,511 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-23 23:52:50,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 23:52:50,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:50,513 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 23:52:50,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-23 23:52:50,515 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 23:52:50,516 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-23 23:52:50,516 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 23:52:50,516 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~n~0#1) = -1*ULTIMATE.start_main_~x~0#1 + 1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2024-11-23 23:52:50,522 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-11-23 23:52:50,523 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-23 23:52:50,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:52:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:52:50,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 23:52:50,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:52:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:52:50,569 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 23:52:50,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:52:50,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:52:50,607 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-11-23 23:52:50,607 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 78 transitions. cyclomatic complexity: 31 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:50,648 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 78 transitions. cyclomatic complexity: 31. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 106 states and 160 transitions. Complement of second has 6 states. [2024-11-23 23:52:50,649 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-11-23 23:52:50,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:50,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2024-11-23 23:52:50,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 90 transitions. Stem has 4 letters. Loop has 4 letters. [2024-11-23 23:52:50,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 23:52:50,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 90 transitions. Stem has 8 letters. Loop has 4 letters. [2024-11-23 23:52:50,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 23:52:50,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 90 transitions. Stem has 4 letters. Loop has 8 letters. [2024-11-23 23:52:50,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 23:52:50,652 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 160 transitions. [2024-11-23 23:52:50,654 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 37 [2024-11-23 23:52:50,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 55 states and 80 transitions. [2024-11-23 23:52:50,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2024-11-23 23:52:50,659 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2024-11-23 23:52:50,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 80 transitions. [2024-11-23 23:52:50,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 23:52:50,659 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 80 transitions. [2024-11-23 23:52:50,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 80 transitions. [2024-11-23 23:52:50,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-23 23:52:50,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 54 states have internal predecessors, (80), 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-11-23 23:52:50,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 80 transitions. [2024-11-23 23:52:50,666 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 80 transitions. [2024-11-23 23:52:50,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-23 23:52:50,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 23:52:50,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:52:50,669 INFO L87 Difference]: Start difference. First operand 55 states and 80 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:50,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:52:50,775 INFO L93 Difference]: Finished difference Result 114 states and 138 transitions. [2024-11-23 23:52:50,775 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 138 transitions. [2024-11-23 23:52:50,777 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 61 [2024-11-23 23:52:50,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 102 states and 126 transitions. [2024-11-23 23:52:50,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 [2024-11-23 23:52:50,778 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2024-11-23 23:52:50,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 126 transitions. [2024-11-23 23:52:50,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 23:52:50,779 INFO L218 hiAutomatonCegarLoop]: Abstraction has 102 states and 126 transitions. [2024-11-23 23:52:50,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 126 transitions. [2024-11-23 23:52:50,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 51. [2024-11-23 23:52:50,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 50 states have internal predecessors, (65), 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-11-23 23:52:50,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2024-11-23 23:52:50,782 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 65 transitions. [2024-11-23 23:52:50,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 23:52:50,783 INFO L425 stractBuchiCegarLoop]: Abstraction has 51 states and 65 transitions. [2024-11-23 23:52:50,783 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-23 23:52:50,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 65 transitions. [2024-11-23 23:52:50,784 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 31 [2024-11-23 23:52:50,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 23:52:50,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 23:52:50,785 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-11-23 23:52:50,785 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-23 23:52:50,785 INFO L747 eck$LassoCheckResult]: Stem: "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(48, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~x~0#1 < 100000);" "main_~x~0#1 := 0;" "assume main_~x~0#1 < main_~n~0#1;" "main_~y~0#1 := 1 + main_~x~0#1;" [2024-11-23 23:52:50,786 INFO L749 eck$LassoCheckResult]: Loop: "assume main_~y~0#1 < main_~n~0#1;" "call main_#t~mem5#1 := read~int#2(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem6#1 := read~int#2(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem5#1 != main_#t~mem6#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" [2024-11-23 23:52:50,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:52:50,786 INFO L85 PathProgramCache]: Analyzing trace with hash -2053740459, now seen corresponding path program 1 times [2024-11-23 23:52:50,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-23 23:52:50,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489142615] [2024-11-23 23:52:50,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:52:50,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:52:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:52:50,879 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-11-23 23:52:50,910 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-23 23:52:50,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-23 23:52:50,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489142615] [2024-11-23 23:52:50,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489142615] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:52:50,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592100629] [2024-11-23 23:52:50,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:52:50,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:52:50,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:50,940 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:52:50,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-11-23 23:52:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:52:50,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 23:52:51,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:52:51,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:52:51,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592100629] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:52:51,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:52:51,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2024-11-23 23:52:51,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177149793] [2024-11-23 23:52:51,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:52:51,087 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-23 23:52:51,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:52:51,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1913031, now seen corresponding path program 1 times [2024-11-23 23:52:51,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-23 23:52:51,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50870181] [2024-11-23 23:52:51,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:52:51,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:52:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:52:51,107 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 23:52:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:52:51,118 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-23 23:52:51,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-23 23:52:51,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-23 23:52:51,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-11-23 23:52:51,224 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. cyclomatic complexity: 20 Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 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-11-23 23:52:51,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:52:51,477 INFO L93 Difference]: Finished difference Result 144 states and 174 transitions. [2024-11-23 23:52:51,477 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 174 transitions. [2024-11-23 23:52:51,479 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 104 [2024-11-23 23:52:51,481 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 142 states and 172 transitions. [2024-11-23 23:52:51,481 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2024-11-23 23:52:51,482 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 130 [2024-11-23 23:52:51,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 142 states and 172 transitions. [2024-11-23 23:52:51,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 23:52:51,482 INFO L218 hiAutomatonCegarLoop]: Abstraction has 142 states and 172 transitions. [2024-11-23 23:52:51,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states and 172 transitions. [2024-11-23 23:52:51,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 58. [2024-11-23 23:52:51,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 1.206896551724138) internal successors, (70), 57 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:51,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2024-11-23 23:52:51,493 INFO L240 hiAutomatonCegarLoop]: Abstraction has 58 states and 70 transitions. [2024-11-23 23:52:51,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-23 23:52:51,494 INFO L425 stractBuchiCegarLoop]: Abstraction has 58 states and 70 transitions. [2024-11-23 23:52:51,495 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-23 23:52:51,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 70 transitions. [2024-11-23 23:52:51,495 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 38 [2024-11-23 23:52:51,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 23:52:51,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 23:52:51,496 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1, 1, 1] [2024-11-23 23:52:51,496 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-23 23:52:51,497 INFO L747 eck$LassoCheckResult]: Stem: "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(48, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~x~0#1 < 100000);" "main_~x~0#1 := 0;" "assume !(main_~x~0#1 < main_~n~0#1);" "call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0;" [2024-11-23 23:52:51,497 INFO L749 eck$LassoCheckResult]: Loop: "assume main_~v~0#1 < 100000;" "havoc main_#t~nondet9#1;call write~int#1(main_#t~nondet9#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" [2024-11-23 23:52:51,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:52:51,497 INFO L85 PathProgramCache]: Analyzing trace with hash -2066234427, now seen corresponding path program 1 times [2024-11-23 23:52:51,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-23 23:52:51,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754500407] [2024-11-23 23:52:51,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:52:51,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:52:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:52:51,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-23 23:52:51,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754500407] [2024-11-23 23:52:51,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754500407] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:52:51,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099061624] [2024-11-23 23:52:51,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:52:51,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:52:51,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:51,815 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:52:51,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-11-23 23:52:51,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:52:51,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-23 23:52:51,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:52:51,927 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:52:52,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099061624] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:52:52,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:52:52,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-11-23 23:52:52,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631148264] [2024-11-23 23:52:52,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:52:52,071 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-23 23:52:52,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:52:52,072 INFO L85 PathProgramCache]: Analyzing trace with hash 3077, now seen corresponding path program 1 times [2024-11-23 23:52:52,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-23 23:52:52,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108267743] [2024-11-23 23:52:52,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:52:52,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:52:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:52:52,077 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 23:52:52,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:52:52,081 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-23 23:52:52,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-23 23:52:52,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-23 23:52:52,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2024-11-23 23:52:52,138 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. cyclomatic complexity: 17 Second operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:52,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:52:52,508 INFO L93 Difference]: Finished difference Result 270 states and 324 transitions. [2024-11-23 23:52:52,508 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 270 states and 324 transitions. [2024-11-23 23:52:52,510 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 192 [2024-11-23 23:52:52,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 270 states to 270 states and 324 transitions. [2024-11-23 23:52:52,513 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2024-11-23 23:52:52,513 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 242 [2024-11-23 23:52:52,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 270 states and 324 transitions. [2024-11-23 23:52:52,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 23:52:52,515 INFO L218 hiAutomatonCegarLoop]: Abstraction has 270 states and 324 transitions. [2024-11-23 23:52:52,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states and 324 transitions. [2024-11-23 23:52:52,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 74. [2024-11-23 23:52:52,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.162162162162162) internal successors, (86), 73 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:52,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2024-11-23 23:52:52,525 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 86 transitions. [2024-11-23 23:52:52,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-23 23:52:52,526 INFO L425 stractBuchiCegarLoop]: Abstraction has 74 states and 86 transitions. [2024-11-23 23:52:52,526 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-23 23:52:52,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 86 transitions. [2024-11-23 23:52:52,527 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 38 [2024-11-23 23:52:52,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 23:52:52,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 23:52:52,530 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [14, 14, 1, 1, 1, 1, 1, 1] [2024-11-23 23:52:52,530 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-23 23:52:52,531 INFO L747 eck$LassoCheckResult]: Stem: "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(48, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~x~0#1 < 100000);" "main_~x~0#1 := 0;" "assume !(main_~x~0#1 < main_~n~0#1);" "call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0;" [2024-11-23 23:52:52,531 INFO L749 eck$LassoCheckResult]: Loop: "assume main_~v~0#1 < 100000;" "havoc main_#t~nondet9#1;call write~int#1(main_#t~nondet9#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" [2024-11-23 23:52:52,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:52:52,531 INFO L85 PathProgramCache]: Analyzing trace with hash 345917925, now seen corresponding path program 2 times [2024-11-23 23:52:52,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-23 23:52:52,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316547285] [2024-11-23 23:52:52,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:52:52,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:52:52,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:52:53,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-23 23:52:53,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316547285] [2024-11-23 23:52:53,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316547285] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:52:53,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731220603] [2024-11-23 23:52:53,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:52:53,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:52:53,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:53,118 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:52:53,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2024-11-23 23:52:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:52:53,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-23 23:52:53,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:52:53,290 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:52:53,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731220603] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:52:53,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:52:53,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2024-11-23 23:52:53,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643568517] [2024-11-23 23:52:53,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:52:53,788 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-23 23:52:53,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:52:53,788 INFO L85 PathProgramCache]: Analyzing trace with hash 3077, now seen corresponding path program 2 times [2024-11-23 23:52:53,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-23 23:52:53,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254750015] [2024-11-23 23:52:53,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:52:53,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:52:53,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:52:53,807 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 23:52:53,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:52:53,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-23 23:52:53,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-23 23:52:53,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-23 23:52:53,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2024-11-23 23:52:53,872 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. cyclomatic complexity: 17 Second operand has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 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-11-23 23:52:54,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:52:54,609 INFO L93 Difference]: Finished difference Result 526 states and 628 transitions. [2024-11-23 23:52:54,609 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 526 states and 628 transitions. [2024-11-23 23:52:54,615 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 368 [2024-11-23 23:52:54,618 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 526 states to 526 states and 628 transitions. [2024-11-23 23:52:54,619 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 466 [2024-11-23 23:52:54,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 466 [2024-11-23 23:52:54,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 526 states and 628 transitions. [2024-11-23 23:52:54,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 23:52:54,622 INFO L218 hiAutomatonCegarLoop]: Abstraction has 526 states and 628 transitions. [2024-11-23 23:52:54,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states and 628 transitions. [2024-11-23 23:52:54,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 106. [2024-11-23 23:52:54,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 106 states have (on average 1.1132075471698113) internal successors, (118), 105 states have internal predecessors, (118), 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-11-23 23:52:54,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2024-11-23 23:52:54,631 INFO L240 hiAutomatonCegarLoop]: Abstraction has 106 states and 118 transitions. [2024-11-23 23:52:54,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-23 23:52:54,639 INFO L425 stractBuchiCegarLoop]: Abstraction has 106 states and 118 transitions. [2024-11-23 23:52:54,639 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-23 23:52:54,639 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 118 transitions. [2024-11-23 23:52:54,643 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 38 [2024-11-23 23:52:54,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 23:52:54,643 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 23:52:54,644 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [30, 30, 1, 1, 1, 1, 1, 1] [2024-11-23 23:52:54,644 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-23 23:52:54,644 INFO L747 eck$LassoCheckResult]: Stem: "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(48, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~x~0#1 < 100000);" "main_~x~0#1 := 0;" "assume !(main_~x~0#1 < main_~n~0#1);" "call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0;" [2024-11-23 23:52:54,645 INFO L749 eck$LassoCheckResult]: Loop: "assume main_~v~0#1 < 100000;" "havoc main_#t~nondet9#1;call write~int#1(main_#t~nondet9#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" [2024-11-23 23:52:54,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:52:54,645 INFO L85 PathProgramCache]: Analyzing trace with hash -151349723, now seen corresponding path program 3 times [2024-11-23 23:52:54,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-23 23:52:54,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024826541] [2024-11-23 23:52:54,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:52:54,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:52:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:52:56,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-23 23:52:56,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024826541] [2024-11-23 23:52:56,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024826541] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:52:56,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645029342] [2024-11-23 23:52:56,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:52:56,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:52:56,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:56,046 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:52:56,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-11-23 23:52:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:52:56,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-23 23:52:56,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:52:56,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:52:58,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645029342] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:52:58,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:52:58,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2024-11-23 23:52:58,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393601835] [2024-11-23 23:52:58,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:52:58,005 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-23 23:52:58,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:52:58,006 INFO L85 PathProgramCache]: Analyzing trace with hash 3077, now seen corresponding path program 3 times [2024-11-23 23:52:58,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-23 23:52:58,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593350838] [2024-11-23 23:52:58,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:52:58,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:52:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:52:58,012 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 23:52:58,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:52:58,016 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-23 23:52:58,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-23 23:52:58,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-11-23 23:52:58,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2024-11-23 23:52:58,071 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. cyclomatic complexity: 17 Second operand has 65 states, 65 states have (on average 2.0153846153846153) internal successors, (131), 65 states have internal predecessors, (131), 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-11-23 23:53:00,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:53:00,405 INFO L93 Difference]: Finished difference Result 1038 states and 1236 transitions. [2024-11-23 23:53:00,406 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1038 states and 1236 transitions. [2024-11-23 23:53:00,414 INFO L131 ngComponentsAnalysis]: Automaton has 66 accepting balls. 720 [2024-11-23 23:53:00,421 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1038 states to 1038 states and 1236 transitions. [2024-11-23 23:53:00,421 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 914 [2024-11-23 23:53:00,423 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 914 [2024-11-23 23:53:00,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1038 states and 1236 transitions. [2024-11-23 23:53:00,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 23:53:00,425 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1038 states and 1236 transitions. [2024-11-23 23:53:00,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states and 1236 transitions. [2024-11-23 23:53:00,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 170. [2024-11-23 23:53:00,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 170 states have (on average 1.0705882352941176) internal successors, (182), 169 states have internal predecessors, (182), 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-11-23 23:53:00,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 182 transitions. [2024-11-23 23:53:00,438 INFO L240 hiAutomatonCegarLoop]: Abstraction has 170 states and 182 transitions. [2024-11-23 23:53:00,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-23 23:53:00,440 INFO L425 stractBuchiCegarLoop]: Abstraction has 170 states and 182 transitions. [2024-11-23 23:53:00,440 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-23 23:53:00,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 170 states and 182 transitions. [2024-11-23 23:53:00,441 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 38 [2024-11-23 23:53:00,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 23:53:00,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 23:53:00,445 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [62, 62, 1, 1, 1, 1, 1, 1] [2024-11-23 23:53:00,445 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-23 23:53:00,445 INFO L747 eck$LassoCheckResult]: Stem: "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(48, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~x~0#1 < 100000);" "main_~x~0#1 := 0;" "assume !(main_~x~0#1 < main_~n~0#1);" "call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0;" [2024-11-23 23:53:00,446 INFO L749 eck$LassoCheckResult]: Loop: "assume main_~v~0#1 < 100000;" "havoc main_#t~nondet9#1;call write~int#1(main_#t~nondet9#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" [2024-11-23 23:53:00,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:53:00,446 INFO L85 PathProgramCache]: Analyzing trace with hash 888155813, now seen corresponding path program 4 times [2024-11-23 23:53:00,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-23 23:53:00,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458644972] [2024-11-23 23:53:00,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:53:00,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:53:00,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:53:04,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-23 23:53:04,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458644972] [2024-11-23 23:53:04,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458644972] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:53:04,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38801499] [2024-11-23 23:53:04,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:53:04,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:53:04,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:53:04,861 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:53:04,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-11-23 23:53:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:53:05,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-23 23:53:05,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:53:05,433 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:53:10,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38801499] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:53:10,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:53:10,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2024-11-23 23:53:10,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482798307] [2024-11-23 23:53:10,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:53:10,677 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-23 23:53:10,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:53:10,677 INFO L85 PathProgramCache]: Analyzing trace with hash 3077, now seen corresponding path program 4 times [2024-11-23 23:53:10,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-23 23:53:10,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521595772] [2024-11-23 23:53:10,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:53:10,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:53:10,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:53:10,685 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 23:53:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:53:10,689 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-23 23:53:10,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-23 23:53:10,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2024-11-23 23:53:10,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2024-11-23 23:53:10,753 INFO L87 Difference]: Start difference. First operand 170 states and 182 transitions. cyclomatic complexity: 17 Second operand has 129 states, 129 states have (on average 2.007751937984496) internal successors, (259), 129 states have internal predecessors, (259), 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-11-23 23:53:23,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:53:23,161 INFO L93 Difference]: Finished difference Result 2062 states and 2452 transitions. [2024-11-23 23:53:23,161 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2062 states and 2452 transitions. [2024-11-23 23:53:23,176 INFO L131 ngComponentsAnalysis]: Automaton has 130 accepting balls. 1424 [2024-11-23 23:53:23,187 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2062 states to 2062 states and 2452 transitions. [2024-11-23 23:53:23,187 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1810 [2024-11-23 23:53:23,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1810 [2024-11-23 23:53:23,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2062 states and 2452 transitions. [2024-11-23 23:53:23,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 23:53:23,193 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2062 states and 2452 transitions. [2024-11-23 23:53:23,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2062 states and 2452 transitions. [2024-11-23 23:53:23,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2062 to 298. [2024-11-23 23:53:23,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 298 states have (on average 1.0402684563758389) internal successors, (310), 297 states have internal predecessors, (310), 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-11-23 23:53:23,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 310 transitions. [2024-11-23 23:53:23,210 INFO L240 hiAutomatonCegarLoop]: Abstraction has 298 states and 310 transitions. [2024-11-23 23:53:23,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2024-11-23 23:53:23,216 INFO L425 stractBuchiCegarLoop]: Abstraction has 298 states and 310 transitions. [2024-11-23 23:53:23,216 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-23 23:53:23,216 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 298 states and 310 transitions. [2024-11-23 23:53:23,218 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 38 [2024-11-23 23:53:23,218 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 23:53:23,218 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 23:53:23,229 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [126, 126, 1, 1, 1, 1, 1, 1] [2024-11-23 23:53:23,233 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-23 23:53:23,233 INFO L747 eck$LassoCheckResult]: Stem: "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(48, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~x~0#1 < 100000);" "main_~x~0#1 := 0;" "assume !(main_~x~0#1 < main_~n~0#1);" "call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0;" [2024-11-23 23:53:23,233 INFO L749 eck$LassoCheckResult]: Loop: "assume main_~v~0#1 < 100000;" "havoc main_#t~nondet9#1;call write~int#1(main_#t~nondet9#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" [2024-11-23 23:53:23,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:53:23,234 INFO L85 PathProgramCache]: Analyzing trace with hash 97476517, now seen corresponding path program 5 times [2024-11-23 23:53:23,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-23 23:53:23,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551765292] [2024-11-23 23:53:23,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:53:23,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:53:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:53:35,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-23 23:53:35,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551765292] [2024-11-23 23:53:35,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551765292] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:53:35,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804294366] [2024-11-23 23:53:35,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:53:35,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:53:35,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:53:35,942 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:53:35,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2024-11-23 23:53:36,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:53:36,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 1437 conjuncts, 128 conjuncts are in the unsatisfiable core [2024-11-23 23:53:36,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:53:36,809 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:53:57,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804294366] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:53:57,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:53:57,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [129, 129, 129] total 257 [2024-11-23 23:53:57,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218433843] [2024-11-23 23:53:57,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:53:57,519 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-23 23:53:57,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:53:57,520 INFO L85 PathProgramCache]: Analyzing trace with hash 3077, now seen corresponding path program 5 times [2024-11-23 23:53:57,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-23 23:53:57,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036547414] [2024-11-23 23:53:57,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:53:57,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:53:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:53:57,525 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 23:53:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:53:57,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-23 23:53:57,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-23 23:53:57,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 257 interpolants. [2024-11-23 23:53:57,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32896, Invalid=32896, Unknown=0, NotChecked=0, Total=65792 [2024-11-23 23:53:57,598 INFO L87 Difference]: Start difference. First operand 298 states and 310 transitions. cyclomatic complexity: 17 Second operand has 257 states, 257 states have (on average 2.0038910505836576) internal successors, (515), 257 states have internal predecessors, (515), 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-11-23 23:56:30,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:56:30,820 INFO L93 Difference]: Finished difference Result 4110 states and 4884 transitions. [2024-11-23 23:56:30,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4110 states and 4884 transitions. [2024-11-23 23:56:30,842 INFO L131 ngComponentsAnalysis]: Automaton has 258 accepting balls. 2832 [2024-11-23 23:56:30,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4110 states to 4110 states and 4884 transitions. [2024-11-23 23:56:30,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3602 [2024-11-23 23:56:30,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3602 [2024-11-23 23:56:30,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4110 states and 4884 transitions. [2024-11-23 23:56:30,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 23:56:30,870 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4110 states and 4884 transitions. [2024-11-23 23:56:30,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4110 states and 4884 transitions. [2024-11-23 23:56:30,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4110 to 554. [2024-11-23 23:56:30,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 554 states have (on average 1.0216606498194947) internal successors, (566), 553 states have internal predecessors, (566), 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-11-23 23:56:30,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 566 transitions. [2024-11-23 23:56:30,902 INFO L240 hiAutomatonCegarLoop]: Abstraction has 554 states and 566 transitions. [2024-11-23 23:56:30,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 256 states. [2024-11-23 23:56:30,903 INFO L425 stractBuchiCegarLoop]: Abstraction has 554 states and 566 transitions. [2024-11-23 23:56:30,904 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-23 23:56:30,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 554 states and 566 transitions. [2024-11-23 23:56:30,906 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 38 [2024-11-23 23:56:30,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 23:56:30,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 23:56:30,917 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [254, 254, 1, 1, 1, 1, 1, 1] [2024-11-23 23:56:30,917 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-23 23:56:30,917 INFO L747 eck$LassoCheckResult]: Stem: "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(48, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume main_~x~0#1 < 100000;" "havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~x~0#1 < 100000);" "main_~x~0#1 := 0;" "assume !(main_~x~0#1 < main_~n~0#1);" "call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0;" [2024-11-23 23:56:30,918 INFO L749 eck$LassoCheckResult]: Loop: "assume main_~v~0#1 < 100000;" "havoc main_#t~nondet9#1;call write~int#1(main_#t~nondet9#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" [2024-11-23 23:56:30,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:56:30,919 INFO L85 PathProgramCache]: Analyzing trace with hash 2069741989, now seen corresponding path program 6 times [2024-11-23 23:56:30,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-23 23:56:30,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24189792] [2024-11-23 23:56:30,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:56:30,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:56:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:57:16,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-23 23:57:16,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24189792] [2024-11-23 23:57:16,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24189792] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:57:16,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263683905] [2024-11-23 23:57:16,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:57:16,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:57:16,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:57:16,999 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:57:17,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_835f3541-f304-4225-8a75-f13ebfffb30b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2024-11-23 23:57:17,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:57:17,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 2845 conjuncts, 256 conjuncts are in the unsatisfiable core [2024-11-23 23:57:17,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:57:18,666 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:58:40,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263683905] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:58:40,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:58:40,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [257, 257, 257] total 513 [2024-11-23 23:58:40,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415790414] [2024-11-23 23:58:40,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:58:40,051 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-23 23:58:40,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:58:40,051 INFO L85 PathProgramCache]: Analyzing trace with hash 3077, now seen corresponding path program 6 times [2024-11-23 23:58:40,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-23 23:58:40,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091120983] [2024-11-23 23:58:40,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:58:40,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:58:40,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:58:40,056 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 23:58:40,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:58:40,061 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-23 23:58:40,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-23 23:58:40,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 513 interpolants. [2024-11-23 23:58:40,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131328, Invalid=131328, Unknown=0, NotChecked=0, Total=262656 [2024-11-23 23:58:40,140 INFO L87 Difference]: Start difference. First operand 554 states and 566 transitions. cyclomatic complexity: 17 Second operand has 513 states, 513 states have (on average 2.0019493177387915) internal successors, (1027), 513 states have internal predecessors, (1027), 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)