./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-examples/standard_vararg_ground.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-examples/standard_vararg_ground.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl --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 28ac72543f751666908cbd68a77fa11ffe4dd886016c3996df45b97bb42d5078 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:32:03,098 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:32:03,195 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-12 02:32:03,201 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:32:03,202 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:32:03,225 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:32:03,226 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:32:03,226 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:32:03,228 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:32:03,228 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:32:03,229 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:32:03,229 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-12 02:32:03,230 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-12 02:32:03,230 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-12 02:32:03,231 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-12 02:32:03,231 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-12 02:32:03,232 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-12 02:32:03,233 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:32:03,233 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-12 02:32:03,234 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:32:03,234 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:32:03,241 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:32:03,241 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:32:03,242 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-12 02:32:03,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-12 02:32:03,243 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-12 02:32:03,243 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 02:32:03,244 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:32:03,244 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:32:03,244 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-12 02:32:03,245 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:32:03,246 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:32:03,247 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:32:03,247 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:32:03,247 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:32:03,248 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-12 02:32:03,248 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl 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 -> 28ac72543f751666908cbd68a77fa11ffe4dd886016c3996df45b97bb42d5078 [2023-11-12 02:32:03,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:32:03,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:32:03,609 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:32:03,612 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:32:03,613 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:32:03,615 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/array-examples/standard_vararg_ground.i [2023-11-12 02:32:06,866 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:32:07,115 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:32:07,115 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/sv-benchmarks/c/array-examples/standard_vararg_ground.i [2023-11-12 02:32:07,123 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/data/116fc7265/08423049a79c4fc4bca163476f18d0af/FLAG39c6502a9 [2023-11-12 02:32:07,138 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/data/116fc7265/08423049a79c4fc4bca163476f18d0af [2023-11-12 02:32:07,141 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:32:07,142 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:32:07,144 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:32:07,144 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:32:07,149 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:32:07,150 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:32:07" (1/1) ... [2023-11-12 02:32:07,151 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d938651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:32:07, skipping insertion in model container [2023-11-12 02:32:07,151 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:32:07" (1/1) ... [2023-11-12 02:32:07,174 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:32:07,332 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:32:07,343 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:32:07,363 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:32:07,381 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:32:07,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:32:07 WrapperNode [2023-11-12 02:32:07,382 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:32:07,383 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:32:07,383 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:32:07,383 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:32:07,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:32:07" (1/1) ... [2023-11-12 02:32:07,401 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:32:07" (1/1) ... [2023-11-12 02:32:07,423 INFO L138 Inliner]: procedures = 16, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 58 [2023-11-12 02:32:07,424 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:32:07,425 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:32:07,425 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:32:07,425 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:32:07,434 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:32:07" (1/1) ... [2023-11-12 02:32:07,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:32:07" (1/1) ... [2023-11-12 02:32:07,437 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:32:07" (1/1) ... [2023-11-12 02:32:07,437 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:32:07" (1/1) ... [2023-11-12 02:32:07,443 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:32:07" (1/1) ... [2023-11-12 02:32:07,447 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:32:07" (1/1) ... [2023-11-12 02:32:07,448 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:32:07" (1/1) ... [2023-11-12 02:32:07,450 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:32:07" (1/1) ... [2023-11-12 02:32:07,452 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:32:07,453 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:32:07,453 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:32:07,453 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:32:07,454 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:32:07" (1/1) ... [2023-11-12 02:32:07,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:32:07,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:32:07,491 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:32:07,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-12 02:32:07,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:32:07,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:32:07,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:32:07,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:32:07,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:32:07,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:32:07,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 02:32:07,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:32:07,602 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:32:07,604 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:32:07,773 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:32:07,780 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:32:07,781 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-12 02:32:07,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:32:07 BoogieIcfgContainer [2023-11-12 02:32:07,783 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:32:07,785 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-12 02:32:07,785 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-12 02:32:07,790 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-12 02:32:07,791 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-12 02:32:07,791 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.11 02:32:07" (1/3) ... [2023-11-12 02:32:07,792 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54d18f40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 02:32:07, skipping insertion in model container [2023-11-12 02:32:07,793 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-12 02:32:07,793 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:32:07" (2/3) ... [2023-11-12 02:32:07,793 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54d18f40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 02:32:07, skipping insertion in model container [2023-11-12 02:32:07,794 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-12 02:32:07,794 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:32:07" (3/3) ... [2023-11-12 02:32:07,795 INFO L332 chiAutomizerObserver]: Analyzing ICFG standard_vararg_ground.i [2023-11-12 02:32:07,858 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-12 02:32:07,858 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-12 02:32:07,859 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-12 02:32:07,859 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-12 02:32:07,859 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-12 02:32:07,859 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-12 02:32:07,859 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-12 02:32:07,859 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-12 02:32:07,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 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) [2023-11-12 02:32:07,879 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2023-11-12 02:32:07,879 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:32:07,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:32:07,883 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-12 02:32:07,884 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-12 02:32:07,884 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-12 02:32:07,884 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 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) [2023-11-12 02:32:07,886 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2023-11-12 02:32:07,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:32:07,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:32:07,886 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-12 02:32:07,887 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-12 02:32:07,893 INFO L748 eck$LassoCheckResult]: Stem: 17#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2); 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_~i~0#1, main_#t~post4#1, main_#t~mem3#1, main_#t~mem6#1, main_#t~post5#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~i~0#1 := 0; 14#L20-3true [2023-11-12 02:32:07,893 INFO L750 eck$LassoCheckResult]: Loop: 14#L20-3true assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 15#L20-2true main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 14#L20-3true [2023-11-12 02:32:07,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:32:07,898 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-11-12 02:32:07,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:32:07,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004250257] [2023-11-12 02:32:07,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:32:07,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:32:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:32:08,018 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:32:08,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:32:08,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:32:08,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:32:08,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2023-11-12 02:32:08,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:32:08,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114778279] [2023-11-12 02:32:08,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:32:08,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:32:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:32:08,077 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:32:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:32:08,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:32:08,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:32:08,089 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2023-11-12 02:32:08,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:32:08,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171241719] [2023-11-12 02:32:08,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:32:08,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:32:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:32:08,135 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:32:08,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:32:08,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:32:08,664 INFO L210 LassoAnalysis]: Preferences: [2023-11-12 02:32:08,665 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-12 02:32:08,665 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-12 02:32:08,665 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-12 02:32:08,665 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-12 02:32:08,666 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:32:08,666 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-12 02:32:08,666 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-12 02:32:08,666 INFO L133 ssoRankerPreferences]: Filename of dumped script: standard_vararg_ground.i_Iteration1_Lasso [2023-11-12 02:32:08,666 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-12 02:32:08,667 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-12 02:32:08,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:32:08,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:32:08,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:32:08,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:32:08,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:32:08,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:32:08,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:32:08,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:32:08,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:32:08,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:32:09,261 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-12 02:32:09,266 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-12 02:32:09,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:32:09,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:32:09,272 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:32:09,286 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 [2023-11-12 02:32:09,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:32:09,299 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:32:09,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:32:09,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:32:09,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:32:09,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-12 02:32:09,303 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:32:09,303 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:32:09,313 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:32:09,323 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-11-12 02:32:09,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:32:09,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:32:09,325 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:32:09,334 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 [2023-11-12 02:32:09,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:32:09,347 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:32:09,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:32:09,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:32:09,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:32:09,348 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:32:09,349 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:32:09,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-12 02:32:09,362 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:32:09,371 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-11-12 02:32:09,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:32:09,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:32:09,373 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:32:09,382 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 [2023-11-12 02:32:09,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:32:09,396 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:32:09,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:32:09,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:32:09,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:32:09,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-12 02:32:09,398 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:32:09,399 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:32:09,415 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:32:09,424 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-11-12 02:32:09,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:32:09,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:32:09,426 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:32:09,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-11-12 02:32:09,436 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 [2023-11-12 02:32:09,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:32:09,449 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:32:09,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:32:09,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:32:09,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:32:09,450 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:32:09,450 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:32:09,460 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:32:09,468 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-11-12 02:32:09,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:32:09,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:32:09,471 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:32:09,480 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 [2023-11-12 02:32:09,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-11-12 02:32:09,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:32:09,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:32:09,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:32:09,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:32:09,498 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-12 02:32:09,498 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-12 02:32:09,516 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:32:09,533 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-11-12 02:32:09,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:32:09,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:32:09,536 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:32:09,540 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-12 02:32:09,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-11-12 02:32:09,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:32:09,553 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:32:09,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:32:09,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:32:09,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:32:09,554 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:32:09,554 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:32:09,564 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:32:09,573 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-11-12 02:32:09,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:32:09,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:32:09,575 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:32:09,585 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 [2023-11-12 02:32:09,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-11-12 02:32:09,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:32:09,597 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:32:09,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:32:09,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:32:09,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:32:09,598 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:32:09,598 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:32:09,609 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:32:09,617 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-11-12 02:32:09,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:32:09,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:32:09,619 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:32:09,623 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 [2023-11-12 02:32:09,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-11-12 02:32:09,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:32:09,634 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:32:09,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:32:09,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:32:09,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:32:09,635 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:32:09,635 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:32:09,645 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:32:09,650 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-11-12 02:32:09,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:32:09,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:32:09,653 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:32:09,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-11-12 02:32:09,661 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 [2023-11-12 02:32:09,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:32:09,677 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:32:09,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:32:09,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:32:09,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:32:09,678 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:32:09,678 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:32:09,692 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:32:09,700 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-11-12 02:32:09,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:32:09,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:32:09,702 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:32:09,713 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 [2023-11-12 02:32:09,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:32:09,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:32:09,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:32:09,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:32:09,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-11-12 02:32:09,735 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-12 02:32:09,735 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-12 02:32:09,750 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-12 02:32:09,777 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2023-11-12 02:32:09,777 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2023-11-12 02:32:09,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:32:09,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:32:09,815 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:32:09,822 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-12 02:32:09,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-11-12 02:32:09,857 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-12 02:32:09,857 INFO L513 LassoAnalysis]: Proved termination. [2023-11-12 02:32:09,858 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~#aa~0#1.base)_1) = -8*ULTIMATE.start_main_~i~0#1 + 199999*v_rep(select #length ULTIMATE.start_main_~#aa~0#1.base)_1 Supporting invariants [] [2023-11-12 02:32:09,867 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-11-12 02:32:09,887 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2023-11-12 02:32:09,896 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[~#aa~0!base] could not be translated [2023-11-12 02:32:09,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:32:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:32:09,940 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-12 02:32:09,941 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:32:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:32:09,959 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-12 02:32:09,960 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:32:10,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:32:10,048 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 [2023-11-12 02:32:10,050 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 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) [2023-11-12 02:32:10,120 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 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 37 states and 53 transitions. Complement of second has 8 states. [2023-11-12 02:32:10,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-12 02:32:10,127 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) [2023-11-12 02:32:10,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2023-11-12 02:32:10,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 2 letters. Loop has 2 letters. [2023-11-12 02:32:10,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-12 02:32:10,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 4 letters. Loop has 2 letters. [2023-11-12 02:32:10,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-12 02:32:10,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 2 letters. Loop has 4 letters. [2023-11-12 02:32:10,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-12 02:32:10,131 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 53 transitions. [2023-11-12 02:32:10,134 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2023-11-12 02:32:10,138 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 16 states and 22 transitions. [2023-11-12 02:32:10,139 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2023-11-12 02:32:10,139 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2023-11-12 02:32:10,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2023-11-12 02:32:10,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:32:10,140 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 22 transitions. [2023-11-12 02:32:10,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2023-11-12 02:32:10,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-11-12 02:32:10,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 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) [2023-11-12 02:32:10,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2023-11-12 02:32:10,168 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 22 transitions. [2023-11-12 02:32:10,169 INFO L428 stractBuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2023-11-12 02:32:10,169 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-12 02:32:10,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2023-11-12 02:32:10,170 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2023-11-12 02:32:10,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:32:10,170 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:32:10,170 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-11-12 02:32:10,170 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-12 02:32:10,171 INFO L748 eck$LassoCheckResult]: Stem: 130#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2); 121#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_~i~0#1, main_#t~post4#1, main_#t~mem3#1, main_#t~mem6#1, main_#t~post5#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~i~0#1 := 0; 122#L20-3 assume !(main_~i~0#1 < 100000); 123#L20-4 havoc main_~i~0#1; 117#L25-3 [2023-11-12 02:32:10,171 INFO L750 eck$LassoCheckResult]: Loop: 117#L25-3 call main_#t~mem3#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); 118#L25-1 assume !!(main_#t~mem3#1 >= 0);havoc main_#t~mem3#1;main_#t~post4#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 117#L25-3 [2023-11-12 02:32:10,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:32:10,171 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2023-11-12 02:32:10,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:32:10,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209757672] [2023-11-12 02:32:10,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:32:10,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:32:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:32:10,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:32:10,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:32:10,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209757672] [2023-11-12 02:32:10,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209757672] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:32:10,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:32:10,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:32:10,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260605594] [2023-11-12 02:32:10,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:32:10,238 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-12 02:32:10,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:32:10,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1638, now seen corresponding path program 1 times [2023-11-12 02:32:10,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:32:10,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251973544] [2023-11-12 02:32:10,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:32:10,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:32:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:32:10,245 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:32:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:32:10,251 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:32:10,279 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-11-12 02:32:10,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:32:10,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:32:10,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:32:10,318 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 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) [2023-11-12 02:32:10,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:32:10,335 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2023-11-12 02:32:10,335 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 18 transitions. [2023-11-12 02:32:10,340 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-11-12 02:32:10,341 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 14 states and 16 transitions. [2023-11-12 02:32:10,342 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2023-11-12 02:32:10,342 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2023-11-12 02:32:10,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2023-11-12 02:32:10,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:32:10,342 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2023-11-12 02:32:10,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2023-11-12 02:32:10,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2023-11-12 02:32:10,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:32:10,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2023-11-12 02:32:10,345 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 15 transitions. [2023-11-12 02:32:10,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:32:10,348 INFO L428 stractBuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2023-11-12 02:32:10,348 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-12 02:32:10,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2023-11-12 02:32:10,350 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-11-12 02:32:10,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:32:10,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:32:10,351 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-11-12 02:32:10,351 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-12 02:32:10,351 INFO L748 eck$LassoCheckResult]: Stem: 163#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2); 164#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_~i~0#1, main_#t~post4#1, main_#t~mem3#1, main_#t~mem6#1, main_#t~post5#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~i~0#1 := 0; 156#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 157#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 158#L20-3 assume !(main_~i~0#1 < 100000); 159#L20-4 havoc main_~i~0#1; 160#L25-3 [2023-11-12 02:32:10,351 INFO L750 eck$LassoCheckResult]: Loop: 160#L25-3 call main_#t~mem3#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); 161#L25-1 assume !!(main_#t~mem3#1 >= 0);havoc main_#t~mem3#1;main_#t~post4#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 160#L25-3 [2023-11-12 02:32:10,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:32:10,357 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2023-11-12 02:32:10,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:32:10,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252262348] [2023-11-12 02:32:10,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:32:10,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:32:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:32:10,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:32:10,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:32:10,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252262348] [2023-11-12 02:32:10,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252262348] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:32:10,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471510448] [2023-11-12 02:32:10,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:32:10,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:32:10,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:32:10,471 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:32:10,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-12 02:32:10,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:32:10,530 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-12 02:32:10,531 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:32:10,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:32:10,547 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:32:10,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:32:10,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471510448] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:32:10,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:32:10,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-12 02:32:10,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815795662] [2023-11-12 02:32:10,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:32:10,577 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-12 02:32:10,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:32:10,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1638, now seen corresponding path program 2 times [2023-11-12 02:32:10,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:32:10,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49603186] [2023-11-12 02:32:10,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:32:10,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:32:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:32:10,597 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:32:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:32:10,607 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:32:10,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:32:10,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:32:10,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:32:10,664 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. cyclomatic complexity: 5 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:32:10,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:32:10,704 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2023-11-12 02:32:10,704 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2023-11-12 02:32:10,707 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-11-12 02:32:10,713 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 21 transitions. [2023-11-12 02:32:10,713 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2023-11-12 02:32:10,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2023-11-12 02:32:10,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 21 transitions. [2023-11-12 02:32:10,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:32:10,714 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 21 transitions. [2023-11-12 02:32:10,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 21 transitions. [2023-11-12 02:32:10,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-11-12 02:32:10,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:32:10,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2023-11-12 02:32:10,718 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 21 transitions. [2023-11-12 02:32:10,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:32:10,720 INFO L428 stractBuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2023-11-12 02:32:10,720 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-12 02:32:10,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2023-11-12 02:32:10,724 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-11-12 02:32:10,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:32:10,724 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:32:10,725 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2023-11-12 02:32:10,725 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-12 02:32:10,725 INFO L748 eck$LassoCheckResult]: Stem: 235#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2); 236#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_~i~0#1, main_#t~post4#1, main_#t~mem3#1, main_#t~mem6#1, main_#t~post5#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~i~0#1 := 0; 228#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 229#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 230#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 231#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 243#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 242#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 241#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 240#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 239#L20-3 assume !(main_~i~0#1 < 100000); 238#L20-4 havoc main_~i~0#1; 232#L25-3 [2023-11-12 02:32:10,725 INFO L750 eck$LassoCheckResult]: Loop: 232#L25-3 call main_#t~mem3#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); 233#L25-1 assume !!(main_#t~mem3#1 >= 0);havoc main_#t~mem3#1;main_#t~post4#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 232#L25-3 [2023-11-12 02:32:10,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:32:10,731 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2023-11-12 02:32:10,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:32:10,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561534805] [2023-11-12 02:32:10,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:32:10,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:32:10,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:32:10,941 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:32:10,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:32:10,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561534805] [2023-11-12 02:32:10,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561534805] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:32:10,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885654187] [2023-11-12 02:32:10,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-12 02:32:10,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:32:10,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:32:10,948 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:32:10,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-12 02:32:11,011 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-12 02:32:11,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 02:32:11,013 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-12 02:32:11,014 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:32:11,043 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:32:11,044 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:32:11,119 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:32:11,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885654187] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:32:11,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:32:11,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-11-12 02:32:11,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433511043] [2023-11-12 02:32:11,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:32:11,120 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-12 02:32:11,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:32:11,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1638, now seen corresponding path program 3 times [2023-11-12 02:32:11,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:32:11,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121544657] [2023-11-12 02:32:11,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:32:11,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:32:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:32:11,126 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:32:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:32:11,131 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:32:11,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:32:11,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-12 02:32:11,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-12 02:32:11,174 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. cyclomatic complexity: 5 Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:32:11,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:32:11,247 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2023-11-12 02:32:11,247 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 33 transitions. [2023-11-12 02:32:11,250 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-11-12 02:32:11,251 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 33 transitions. [2023-11-12 02:32:11,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2023-11-12 02:32:11,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2023-11-12 02:32:11,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 33 transitions. [2023-11-12 02:32:11,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:32:11,253 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 33 transitions. [2023-11-12 02:32:11,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 33 transitions. [2023-11-12 02:32:11,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-11-12 02:32:11,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.064516129032258) internal successors, (33), 30 states have internal predecessors, (33), 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) [2023-11-12 02:32:11,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2023-11-12 02:32:11,261 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 33 transitions. [2023-11-12 02:32:11,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-12 02:32:11,264 INFO L428 stractBuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2023-11-12 02:32:11,264 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-12 02:32:11,264 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 33 transitions. [2023-11-12 02:32:11,266 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-11-12 02:32:11,267 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:32:11,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:32:11,269 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2023-11-12 02:32:11,269 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-12 02:32:11,274 INFO L748 eck$LassoCheckResult]: Stem: 368#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2); 369#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_~i~0#1, main_#t~post4#1, main_#t~mem3#1, main_#t~mem6#1, main_#t~post5#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~i~0#1 := 0; 360#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 361#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 362#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 363#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 364#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 387#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 386#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 385#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 384#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 383#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 382#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 381#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 380#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 379#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 378#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 377#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 376#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 375#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 374#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 373#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 372#L20-3 assume !(main_~i~0#1 < 100000); 371#L20-4 havoc main_~i~0#1; 365#L25-3 [2023-11-12 02:32:11,274 INFO L750 eck$LassoCheckResult]: Loop: 365#L25-3 call main_#t~mem3#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); 366#L25-1 assume !!(main_#t~mem3#1 >= 0);havoc main_#t~mem3#1;main_#t~post4#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 365#L25-3 [2023-11-12 02:32:11,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:32:11,275 INFO L85 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 3 times [2023-11-12 02:32:11,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:32:11,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195980839] [2023-11-12 02:32:11,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:32:11,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:32:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:32:11,645 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:32:11,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:32:11,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195980839] [2023-11-12 02:32:11,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195980839] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:32:11,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235831576] [2023-11-12 02:32:11,646 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-12 02:32:11,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:32:11,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:32:11,651 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:32:11,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-12 02:32:11,850 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-11-12 02:32:11,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 02:32:11,852 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-12 02:32:11,853 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:32:11,932 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:32:11,933 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:32:12,268 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:32:12,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235831576] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:32:12,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:32:12,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2023-11-12 02:32:12,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698372955] [2023-11-12 02:32:12,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:32:12,270 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-12 02:32:12,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:32:12,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1638, now seen corresponding path program 4 times [2023-11-12 02:32:12,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:32:12,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817156987] [2023-11-12 02:32:12,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:32:12,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:32:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:32:12,276 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:32:12,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:32:12,281 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:32:12,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:32:12,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-12 02:32:12,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2023-11-12 02:32:12,326 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. cyclomatic complexity: 5 Second operand has 25 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 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) [2023-11-12 02:32:12,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:32:12,472 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2023-11-12 02:32:12,473 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 57 transitions. [2023-11-12 02:32:12,481 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-11-12 02:32:12,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 57 transitions. [2023-11-12 02:32:12,482 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2023-11-12 02:32:12,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2023-11-12 02:32:12,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 57 transitions. [2023-11-12 02:32:12,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:32:12,484 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 57 transitions. [2023-11-12 02:32:12,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 57 transitions. [2023-11-12 02:32:12,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-11-12 02:32:12,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 54 states have internal predecessors, (57), 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) [2023-11-12 02:32:12,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2023-11-12 02:32:12,504 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 57 transitions. [2023-11-12 02:32:12,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-12 02:32:12,505 INFO L428 stractBuchiCegarLoop]: Abstraction has 55 states and 57 transitions. [2023-11-12 02:32:12,507 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-12 02:32:12,507 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 57 transitions. [2023-11-12 02:32:12,508 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-11-12 02:32:12,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:32:12,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:32:12,511 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 1, 1, 1, 1] [2023-11-12 02:32:12,513 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-12 02:32:12,513 INFO L748 eck$LassoCheckResult]: Stem: 620#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2); 621#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_~i~0#1, main_#t~post4#1, main_#t~mem3#1, main_#t~mem6#1, main_#t~post5#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~i~0#1 := 0; 612#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 613#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 614#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 615#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 616#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 663#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 662#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 661#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 660#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 659#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 658#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 657#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 656#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 655#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 654#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 653#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 652#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 651#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 650#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 649#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 648#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 647#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 646#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 645#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 644#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 643#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 642#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 641#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 640#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 639#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 638#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 637#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 636#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 635#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 634#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 633#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 632#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 631#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 630#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 629#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 628#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 627#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 626#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 625#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 624#L20-3 assume !(main_~i~0#1 < 100000); 623#L20-4 havoc main_~i~0#1; 617#L25-3 [2023-11-12 02:32:12,513 INFO L750 eck$LassoCheckResult]: Loop: 617#L25-3 call main_#t~mem3#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); 618#L25-1 assume !!(main_#t~mem3#1 >= 0);havoc main_#t~mem3#1;main_#t~post4#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 617#L25-3 [2023-11-12 02:32:12,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:32:12,514 INFO L85 PathProgramCache]: Analyzing trace with hash 828161207, now seen corresponding path program 4 times [2023-11-12 02:32:12,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:32:12,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258417621] [2023-11-12 02:32:12,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:32:12,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:32:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:32:13,427 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:32:13,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:32:13,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258417621] [2023-11-12 02:32:13,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258417621] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:32:13,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492525180] [2023-11-12 02:32:13,428 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-12 02:32:13,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:32:13,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:32:13,432 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:32:13,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-12 02:32:13,578 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-12 02:32:13,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 02:32:13,581 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-12 02:32:13,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:32:13,738 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:32:13,738 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:32:14,741 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:32:14,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492525180] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:32:14,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:32:14,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2023-11-12 02:32:14,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257791074] [2023-11-12 02:32:14,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:32:14,742 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-12 02:32:14,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:32:14,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1638, now seen corresponding path program 5 times [2023-11-12 02:32:14,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:32:14,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865893090] [2023-11-12 02:32:14,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:32:14,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:32:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:32:14,751 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:32:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:32:14,757 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:32:14,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:32:14,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-12 02:32:14,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2023-11-12 02:32:14,809 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. cyclomatic complexity: 5 Second operand has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 49 states have internal predecessors, (97), 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) [2023-11-12 02:32:15,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:32:15,081 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2023-11-12 02:32:15,082 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 105 transitions. [2023-11-12 02:32:15,084 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-11-12 02:32:15,085 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 103 states and 105 transitions. [2023-11-12 02:32:15,085 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2023-11-12 02:32:15,086 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2023-11-12 02:32:15,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 105 transitions. [2023-11-12 02:32:15,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:32:15,087 INFO L218 hiAutomatonCegarLoop]: Abstraction has 103 states and 105 transitions. [2023-11-12 02:32:15,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 105 transitions. [2023-11-12 02:32:15,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2023-11-12 02:32:15,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 103 states have (on average 1.0194174757281553) internal successors, (105), 102 states have internal predecessors, (105), 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) [2023-11-12 02:32:15,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 105 transitions. [2023-11-12 02:32:15,094 INFO L240 hiAutomatonCegarLoop]: Abstraction has 103 states and 105 transitions. [2023-11-12 02:32:15,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-11-12 02:32:15,095 INFO L428 stractBuchiCegarLoop]: Abstraction has 103 states and 105 transitions. [2023-11-12 02:32:15,096 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-12 02:32:15,096 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 103 states and 105 transitions. [2023-11-12 02:32:15,097 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-11-12 02:32:15,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:32:15,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:32:15,101 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 46, 1, 1, 1, 1] [2023-11-12 02:32:15,101 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-12 02:32:15,102 INFO L748 eck$LassoCheckResult]: Stem: 1113#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2); 1114#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_~i~0#1, main_#t~post4#1, main_#t~mem3#1, main_#t~mem6#1, main_#t~post5#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~i~0#1 := 0; 1104#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1105#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1106#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1107#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1108#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1203#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1202#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1201#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1200#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1199#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1198#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1197#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1196#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1195#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1194#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1193#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1192#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1191#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1190#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1189#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1188#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1187#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1186#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1185#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1184#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1183#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1182#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1181#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1180#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1179#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1178#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1177#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1176#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1175#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1174#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1173#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1172#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1171#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1170#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1169#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1168#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1167#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1166#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1165#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1164#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1163#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1162#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1161#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1160#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1159#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1158#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1157#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1156#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1155#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1154#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1153#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1152#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1151#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1150#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1149#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1148#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1147#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1146#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1145#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1144#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1143#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1142#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1141#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1140#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1139#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1138#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1137#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1136#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1135#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1134#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1133#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1132#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1131#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1130#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1129#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1128#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1127#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1126#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1125#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1124#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1123#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1122#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1121#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1120#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1119#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1118#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1117#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1116#L20-3 assume !(main_~i~0#1 < 100000); 1115#L20-4 havoc main_~i~0#1; 1109#L25-3 [2023-11-12 02:32:15,102 INFO L750 eck$LassoCheckResult]: Loop: 1109#L25-3 call main_#t~mem3#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); 1110#L25-1 assume !!(main_#t~mem3#1 >= 0);havoc main_#t~mem3#1;main_#t~post4#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1109#L25-3 [2023-11-12 02:32:15,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:32:15,103 INFO L85 PathProgramCache]: Analyzing trace with hash 830581479, now seen corresponding path program 5 times [2023-11-12 02:32:15,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:32:15,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764005066] [2023-11-12 02:32:15,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:32:15,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:32:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:32:17,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:32:17,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:32:17,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764005066] [2023-11-12 02:32:17,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764005066] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:32:17,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933828194] [2023-11-12 02:32:17,949 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-12 02:32:17,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:32:17,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:32:17,956 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:32:17,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-12 02:32:37,255 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2023-11-12 02:32:37,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 02:32:37,276 INFO L262 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-12 02:32:37,282 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:32:37,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:32:37,531 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:32:41,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:32:41,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933828194] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:32:41,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:32:41,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2023-11-12 02:32:41,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398360823] [2023-11-12 02:32:41,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:32:41,348 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-12 02:32:41,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:32:41,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1638, now seen corresponding path program 6 times [2023-11-12 02:32:41,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:32:41,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492967358] [2023-11-12 02:32:41,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:32:41,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:32:41,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:32:41,355 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:32:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:32:41,358 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:32:41,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:32:41,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2023-11-12 02:32:41,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2023-11-12 02:32:41,407 INFO L87 Difference]: Start difference. First operand 103 states and 105 transitions. cyclomatic complexity: 5 Second operand has 97 states, 97 states have (on average 1.9896907216494846) internal successors, (193), 97 states have internal predecessors, (193), 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) [2023-11-12 02:32:41,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:32:41,891 INFO L93 Difference]: Finished difference Result 199 states and 201 transitions. [2023-11-12 02:32:41,891 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 199 states and 201 transitions. [2023-11-12 02:32:41,893 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-11-12 02:32:41,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 199 states to 199 states and 201 transitions. [2023-11-12 02:32:41,899 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2023-11-12 02:32:41,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2023-11-12 02:32:41,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 199 states and 201 transitions. [2023-11-12 02:32:41,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:32:41,906 INFO L218 hiAutomatonCegarLoop]: Abstraction has 199 states and 201 transitions. [2023-11-12 02:32:41,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states and 201 transitions. [2023-11-12 02:32:41,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2023-11-12 02:32:41,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 199 states have (on average 1.0100502512562815) internal successors, (201), 198 states have internal predecessors, (201), 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) [2023-11-12 02:32:41,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 201 transitions. [2023-11-12 02:32:41,927 INFO L240 hiAutomatonCegarLoop]: Abstraction has 199 states and 201 transitions. [2023-11-12 02:32:41,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2023-11-12 02:32:41,930 INFO L428 stractBuchiCegarLoop]: Abstraction has 199 states and 201 transitions. [2023-11-12 02:32:41,931 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-12 02:32:41,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 199 states and 201 transitions. [2023-11-12 02:32:41,932 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-11-12 02:32:41,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:32:41,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:32:41,950 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [94, 94, 1, 1, 1, 1] [2023-11-12 02:32:41,952 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-12 02:32:41,956 INFO L748 eck$LassoCheckResult]: Stem: 2085#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2); 2086#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_~i~0#1, main_#t~post4#1, main_#t~mem3#1, main_#t~mem6#1, main_#t~post5#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~i~0#1 := 0; 2076#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2077#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2078#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2079#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2080#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2271#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2270#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2269#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2268#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2267#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2266#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2265#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2264#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2263#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2262#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2261#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2260#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2259#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2258#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2257#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2256#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2255#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2254#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2253#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2252#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2251#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2250#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2249#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2248#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2247#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2246#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2245#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2244#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2243#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2242#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2241#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2240#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2239#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2238#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2237#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2236#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2235#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2234#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2233#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2232#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2231#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2230#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2229#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2228#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2227#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2226#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2225#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2224#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2223#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2222#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2221#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2220#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2219#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2218#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2217#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2216#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2215#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2214#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2213#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2212#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2211#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2210#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2209#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2208#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2207#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2206#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2205#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2204#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2203#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2202#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2201#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2200#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2199#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2198#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2197#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2196#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2195#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2194#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2193#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2192#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2191#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2190#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2189#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2188#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2187#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2186#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2185#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2184#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2183#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2182#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2181#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2180#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2179#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2178#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2177#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2176#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2175#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2174#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2173#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2172#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2171#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2170#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2169#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2168#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2167#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2166#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2165#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2164#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2163#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2162#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2161#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2160#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2159#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2158#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2157#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2156#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2155#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2154#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2153#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2152#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2151#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2150#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2149#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2148#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2147#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2146#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2145#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2144#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2143#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2142#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2141#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2140#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2139#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2138#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2137#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2136#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2135#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2134#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2133#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2132#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2131#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2130#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2129#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2128#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2127#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2126#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2125#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2124#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2123#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2122#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2121#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2120#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2119#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2118#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2117#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2116#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2115#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2114#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2113#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2112#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2111#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2110#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2109#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2108#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2107#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2106#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2105#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2104#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2103#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2102#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2101#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2100#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2099#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2098#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2097#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2096#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2095#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2094#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2093#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2092#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2091#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2090#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet2#1;call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2089#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2088#L20-3 assume !(main_~i~0#1 < 100000); 2087#L20-4 havoc main_~i~0#1; 2081#L25-3 [2023-11-12 02:32:41,956 INFO L750 eck$LassoCheckResult]: Loop: 2081#L25-3 call main_#t~mem3#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); 2082#L25-1 assume !!(main_#t~mem3#1 >= 0);havoc main_#t~mem3#1;main_#t~post4#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2081#L25-3 [2023-11-12 02:32:41,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:32:41,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1165371207, now seen corresponding path program 6 times [2023-11-12 02:32:41,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:32:41,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137653025] [2023-11-12 02:32:41,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:32:41,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:32:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:32:50,508 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:32:50,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:32:50,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137653025] [2023-11-12 02:32:50,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137653025] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:32:50,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804349283] [2023-11-12 02:32:50,509 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-12 02:32:50,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:32:50,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:32:50,514 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:32:50,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff3d1c10-435d-4bf3-aba7-e6f261962c3a/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process