./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-industry-pattern/array_monotonic.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9bd2c7ff 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_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-industry-pattern/array_monotonic.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5e947ce3cb6be538c3110154d89a790a98803ec545aa8464d99fb543118ea442 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 08:03:48,130 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 08:03:48,255 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-19 08:03:48,265 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 08:03:48,265 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 08:03:48,306 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 08:03:48,308 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 08:03:48,308 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 08:03:48,310 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 08:03:48,314 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 08:03:48,315 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 08:03:48,316 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-19 08:03:48,316 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-19 08:03:48,317 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-19 08:03:48,317 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-19 08:03:48,317 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-19 08:03:48,318 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-19 08:03:48,318 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 08:03:48,318 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-19 08:03:48,319 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 08:03:48,319 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 08:03:48,326 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 08:03:48,326 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 08:03:48,326 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-19 08:03:48,327 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-19 08:03:48,327 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-19 08:03:48,328 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 08:03:48,328 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 08:03:48,329 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 08:03:48,329 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-19 08:03:48,330 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 08:03:48,331 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 08:03:48,331 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 08:03:48,331 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 08:03:48,332 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 08:03:48,332 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-19 08:03:48,333 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_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/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_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5e947ce3cb6be538c3110154d89a790a98803ec545aa8464d99fb543118ea442 [2023-11-19 08:03:48,627 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 08:03:48,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 08:03:48,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 08:03:48,663 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 08:03:48,664 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 08:03:48,665 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/array-industry-pattern/array_monotonic.i [2023-11-19 08:03:51,863 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 08:03:52,088 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 08:03:52,089 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/sv-benchmarks/c/array-industry-pattern/array_monotonic.i [2023-11-19 08:03:52,099 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/data/ea9c59abc/cf2ad110121f42768b31b66619c72415/FLAG03ed8d085 [2023-11-19 08:03:52,119 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/data/ea9c59abc/cf2ad110121f42768b31b66619c72415 [2023-11-19 08:03:52,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 08:03:52,125 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 08:03:52,127 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 08:03:52,127 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 08:03:52,134 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 08:03:52,136 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:03:52" (1/1) ... [2023-11-19 08:03:52,137 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50fda63f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:52, skipping insertion in model container [2023-11-19 08:03:52,138 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:03:52" (1/1) ... [2023-11-19 08:03:52,165 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 08:03:52,409 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:03:52,424 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 08:03:52,454 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:03:52,480 INFO L206 MainTranslator]: Completed translation [2023-11-19 08:03:52,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:52 WrapperNode [2023-11-19 08:03:52,481 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 08:03:52,482 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 08:03:52,482 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 08:03:52,483 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 08:03:52,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:52" (1/1) ... [2023-11-19 08:03:52,500 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:52" (1/1) ... [2023-11-19 08:03:52,522 INFO L138 Inliner]: procedures = 16, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 50 [2023-11-19 08:03:52,523 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 08:03:52,524 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 08:03:52,524 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 08:03:52,524 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 08:03:52,536 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:52" (1/1) ... [2023-11-19 08:03:52,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:52" (1/1) ... [2023-11-19 08:03:52,538 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:52" (1/1) ... [2023-11-19 08:03:52,539 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:52" (1/1) ... [2023-11-19 08:03:52,545 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:52" (1/1) ... [2023-11-19 08:03:52,549 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:52" (1/1) ... [2023-11-19 08:03:52,551 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:52" (1/1) ... [2023-11-19 08:03:52,552 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:52" (1/1) ... [2023-11-19 08:03:52,554 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 08:03:52,555 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 08:03:52,555 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 08:03:52,556 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 08:03:52,557 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:52" (1/1) ... [2023-11-19 08:03:52,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 08:03:52,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:03:52,595 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 08:03:52,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-19 08:03:52,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 08:03:52,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 08:03:52,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 08:03:52,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 08:03:52,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 08:03:52,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 08:03:52,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 08:03:52,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 08:03:52,729 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 08:03:52,732 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 08:03:52,900 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 08:03:52,908 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 08:03:52,908 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-19 08:03:52,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:03:52 BoogieIcfgContainer [2023-11-19 08:03:52,913 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 08:03:52,914 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-19 08:03:52,914 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-19 08:03:52,918 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-19 08:03:52,919 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-19 08:03:52,920 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 08:03:52" (1/3) ... [2023-11-19 08:03:52,921 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b744dd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 08:03:52, skipping insertion in model container [2023-11-19 08:03:52,921 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-19 08:03:52,921 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:52" (2/3) ... [2023-11-19 08:03:52,922 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b744dd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 08:03:52, skipping insertion in model container [2023-11-19 08:03:52,922 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-19 08:03:52,922 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:03:52" (3/3) ... [2023-11-19 08:03:52,924 INFO L332 chiAutomizerObserver]: Analyzing ICFG array_monotonic.i [2023-11-19 08:03:52,989 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-19 08:03:52,989 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-19 08:03:52,990 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-19 08:03:52,990 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-19 08:03:52,990 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-19 08:03:52,990 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-19 08:03:52,990 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-19 08:03:52,991 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-19 08:03:52,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:53,014 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2023-11-19 08:03:53,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 08:03:53,014 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 08:03:53,020 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-19 08:03:53,020 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-19 08:03:53,020 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-19 08:03:53,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:53,023 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2023-11-19 08:03:53,024 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 08:03:53,024 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 08:03:53,025 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-19 08:03:53,025 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-19 08:03:53,032 INFO L748 eck$LassoCheckResult]: Stem: 15#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 12#L20-3true [2023-11-19 08:03:53,033 INFO L750 eck$LassoCheckResult]: Loop: 12#L20-3true assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 16#L23true assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 13#L20-2true main_~i~0#1 := 2 + main_~i~0#1; 12#L20-3true [2023-11-19 08:03:53,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:53,038 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-11-19 08:03:53,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:53,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298824170] [2023-11-19 08:03:53,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:53,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:03:53,241 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:03:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:03:53,279 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:03:53,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:53,283 INFO L85 PathProgramCache]: Analyzing trace with hash 39821, now seen corresponding path program 1 times [2023-11-19 08:03:53,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:53,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136861802] [2023-11-19 08:03:53,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:53,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:03:53,308 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:03:53,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:03:53,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:03:53,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:53,327 INFO L85 PathProgramCache]: Analyzing trace with hash 28698763, now seen corresponding path program 1 times [2023-11-19 08:03:53,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:53,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887505898] [2023-11-19 08:03:53,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:53,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:53,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:03:53,371 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:03:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:03:53,402 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:03:53,958 INFO L210 LassoAnalysis]: Preferences: [2023-11-19 08:03:53,959 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-19 08:03:53,959 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-19 08:03:53,959 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-19 08:03:53,959 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-19 08:03:53,959 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 08:03:53,960 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-19 08:03:53,960 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-19 08:03:53,960 INFO L133 ssoRankerPreferences]: Filename of dumped script: array_monotonic.i_Iteration1_Lasso [2023-11-19 08:03:53,960 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-19 08:03:53,961 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-19 08:03:53,986 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-19 08:03:53,997 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-19 08:03:54,001 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-19 08:03:54,431 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-19 08:03:54,435 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-19 08:03:54,438 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-19 08:03:54,757 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-19 08:03:54,762 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-19 08:03:54,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 08:03:54,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:03:54,770 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 08:03:54,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-19 08:03:54,799 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-19 08:03:54,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 08:03:54,814 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-19 08:03:54,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 08:03:54,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 08:03:54,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 08:03:54,817 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-19 08:03:54,817 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-19 08:03:54,825 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 08:03:54,850 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-11-19 08:03:54,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 08:03:54,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:03:54,852 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 08:03:54,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-19 08:03:54,875 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-19 08:03:54,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 08:03:54,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-19 08:03:54,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 08:03:54,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 08:03:54,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 08:03:54,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-19 08:03:54,891 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-19 08:03:54,899 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 08:03:54,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-11-19 08:03:54,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 08:03:54,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:03:54,924 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 08:03:54,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-19 08:03:54,930 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-19 08:03:54,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 08:03:54,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 08:03:54,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 08:03:54,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 08:03:54,969 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-19 08:03:54,969 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-19 08:03:54,981 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 08:03:55,010 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-11-19 08:03:55,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 08:03:55,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:03:55,014 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 08:03:55,034 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-19 08:03:55,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-11-19 08:03:55,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 08:03:55,048 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-19 08:03:55,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 08:03:55,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 08:03:55,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 08:03:55,061 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-19 08:03:55,062 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-19 08:03:55,081 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 08:03:55,096 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-11-19 08:03:55,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 08:03:55,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:03:55,098 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 08:03:55,102 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-19 08:03:55,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-11-19 08:03:55,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 08:03:55,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 08:03:55,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 08:03:55,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 08:03:55,119 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-19 08:03:55,119 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-19 08:03:55,145 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 08:03:55,169 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-11-19 08:03:55,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 08:03:55,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:03:55,172 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 08:03:55,183 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-19 08:03:55,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-11-19 08:03:55,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 08:03:55,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 08:03:55,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 08:03:55,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 08:03:55,203 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-19 08:03:55,203 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-19 08:03:55,215 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 08:03:55,238 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-11-19 08:03:55,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 08:03:55,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:03:55,241 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 08:03:55,251 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-19 08:03:55,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 08:03:55,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 08:03:55,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 08:03:55,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 08:03:55,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-11-19 08:03:55,271 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-19 08:03:55,273 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-19 08:03:55,293 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 08:03:55,317 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-11-19 08:03:55,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 08:03:55,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:03:55,324 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 08:03:55,331 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-19 08:03:55,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 08:03:55,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 08:03:55,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 08:03:55,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 08:03:55,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-11-19 08:03:55,350 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-19 08:03:55,350 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-19 08:03:55,370 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 08:03:55,394 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-11-19 08:03:55,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 08:03:55,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:03:55,396 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 08:03:55,407 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-19 08:03:55,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-11-19 08:03:55,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 08:03:55,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 08:03:55,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 08:03:55,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 08:03:55,426 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-19 08:03:55,427 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-19 08:03:55,449 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 08:03:55,470 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-11-19 08:03:55,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 08:03:55,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:03:55,472 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 08:03:55,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-11-19 08:03:55,483 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-19 08:03:55,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 08:03:55,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 08:03:55,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 08:03:55,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 08:03:55,501 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-19 08:03:55,501 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-19 08:03:55,521 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 08:03:55,545 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-11-19 08:03:55,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 08:03:55,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:03:55,547 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 08:03:55,560 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-19 08:03:55,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-11-19 08:03:55,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 08:03:55,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 08:03:55,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 08:03:55,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 08:03:55,616 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-19 08:03:55,616 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-19 08:03:55,637 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 08:03:55,661 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-11-19 08:03:55,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 08:03:55,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:03:55,663 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 08:03:55,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-11-19 08:03:55,670 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-19 08:03:55,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 08:03:55,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 08:03:55,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 08:03:55,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 08:03:55,713 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-19 08:03:55,713 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-19 08:03:55,726 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-19 08:03:55,750 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-11-19 08:03:55,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 08:03:55,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:03:55,751 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 08:03:55,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-11-19 08:03:55,753 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-19 08:03:55,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-19 08:03:55,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-19 08:03:55,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-19 08:03:55,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-19 08:03:55,774 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-19 08:03:55,775 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-19 08:03:55,792 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-19 08:03:55,839 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2023-11-19 08:03:55,839 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 15 variables to zero. [2023-11-19 08:03:55,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 08:03:55,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:03:55,871 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 08:03:55,873 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-19 08:03:55,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-11-19 08:03:55,905 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-19 08:03:55,906 INFO L513 LassoAnalysis]: Proved termination. [2023-11-19 08:03:55,906 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1) = -1*ULTIMATE.start_main_~i~0#1 + 25000*v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1 Supporting invariants [] [2023-11-19 08:03:55,929 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-11-19 08:03:55,981 INFO L156 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2023-11-19 08:03:55,992 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[~#a~0!base] could not be translated [2023-11-19 08:03:56,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:56,042 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-19 08:03:56,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:03:56,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:56,078 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-19 08:03:56,079 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:03:56,155 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-19 08:03:56,215 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-19 08:03:56,219 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:56,303 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 51 transitions. Complement of second has 8 states. [2023-11-19 08:03:56,306 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-19 08:03:56,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:56,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2023-11-19 08:03:56,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 2 letters. Loop has 3 letters. [2023-11-19 08:03:56,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-19 08:03:56,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 5 letters. Loop has 3 letters. [2023-11-19 08:03:56,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-19 08:03:56,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 2 letters. Loop has 6 letters. [2023-11-19 08:03:56,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-19 08:03:56,329 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 51 transitions. [2023-11-19 08:03:56,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-11-19 08:03:56,343 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 15 states and 21 transitions. [2023-11-19 08:03:56,344 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2023-11-19 08:03:56,345 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2023-11-19 08:03:56,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 21 transitions. [2023-11-19 08:03:56,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:03:56,346 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 21 transitions. [2023-11-19 08:03:56,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 21 transitions. [2023-11-19 08:03:56,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-11-19 08:03:56,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:56,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2023-11-19 08:03:56,383 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 21 transitions. [2023-11-19 08:03:56,383 INFO L428 stractBuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2023-11-19 08:03:56,384 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-19 08:03:56,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2023-11-19 08:03:56,387 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-11-19 08:03:56,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 08:03:56,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 08:03:56,389 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-11-19 08:03:56,390 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-19 08:03:56,390 INFO L748 eck$LassoCheckResult]: Stem: 153#$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(18, 2); 142#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 143#L20-3 assume !(main_~i~0#1 < 100000); 144#L20-4 main_~i~0#1 := 0; 145#L26-3 [2023-11-19 08:03:56,391 INFO L750 eck$LassoCheckResult]: Loop: 145#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 152#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 141#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 145#L26-3 [2023-11-19 08:03:56,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:56,400 INFO L85 PathProgramCache]: Analyzing trace with hash 925712, now seen corresponding path program 1 times [2023-11-19 08:03:56,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:56,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332262372] [2023-11-19 08:03:56,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:56,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:56,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:56,530 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-19 08:03:56,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:56,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332262372] [2023-11-19 08:03:56,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332262372] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:03:56,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:03:56,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:03:56,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305660736] [2023-11-19 08:03:56,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:03:56,536 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-19 08:03:56,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:56,536 INFO L85 PathProgramCache]: Analyzing trace with hash 59262, now seen corresponding path program 1 times [2023-11-19 08:03:56,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:56,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609265332] [2023-11-19 08:03:56,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:56,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:56,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:03:56,550 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:03:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:03:56,569 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:03:56,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:56,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:03:56,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:03:56,637 INFO L87 Difference]: Start difference. First operand 15 states and 21 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:56,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:03:56,674 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2023-11-19 08:03:56,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2023-11-19 08:03:56,680 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-11-19 08:03:56,681 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 19 states and 24 transitions. [2023-11-19 08:03:56,681 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2023-11-19 08:03:56,682 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2023-11-19 08:03:56,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2023-11-19 08:03:56,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:03:56,682 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 24 transitions. [2023-11-19 08:03:56,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2023-11-19 08:03:56,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 12. [2023-11-19 08:03:56,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:56,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2023-11-19 08:03:56,688 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 15 transitions. [2023-11-19 08:03:56,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:03:56,689 INFO L428 stractBuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2023-11-19 08:03:56,690 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-19 08:03:56,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2023-11-19 08:03:56,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-11-19 08:03:56,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 08:03:56,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 08:03:56,693 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:03:56,693 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-19 08:03:56,694 INFO L748 eck$LassoCheckResult]: Stem: 193#$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(18, 2); 194#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 187#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 188#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 191#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 189#L20-3 assume !(main_~i~0#1 < 100000); 190#L20-4 main_~i~0#1 := 0; 186#L26-3 [2023-11-19 08:03:56,694 INFO L750 eck$LassoCheckResult]: Loop: 186#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 192#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 185#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 186#L26-3 [2023-11-19 08:03:56,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:56,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1809767318, now seen corresponding path program 1 times [2023-11-19 08:03:56,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:56,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333805327] [2023-11-19 08:03:56,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:56,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:56,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:56,789 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-19 08:03:56,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:56,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333805327] [2023-11-19 08:03:56,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333805327] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:03:56,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689910627] [2023-11-19 08:03:56,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:56,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:03:56,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:03:56,792 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:03:56,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-19 08:03:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:56,848 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-19 08:03:56,848 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:03:56,862 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-19 08:03:56,862 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 08:03:56,888 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-19 08:03:56,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689910627] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 08:03:56,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 08:03:56,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-19 08:03:56,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315484589] [2023-11-19 08:03:56,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 08:03:56,891 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-19 08:03:56,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:56,891 INFO L85 PathProgramCache]: Analyzing trace with hash 59262, now seen corresponding path program 2 times [2023-11-19 08:03:56,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:56,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294613813] [2023-11-19 08:03:56,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:56,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:56,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:03:56,900 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:03:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:03:56,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:03:56,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:56,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 08:03:56,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-19 08:03:56,949 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:57,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:03:57,036 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2023-11-19 08:03:57,036 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 46 transitions. [2023-11-19 08:03:57,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-11-19 08:03:57,044 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 46 transitions. [2023-11-19 08:03:57,044 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2023-11-19 08:03:57,044 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2023-11-19 08:03:57,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 46 transitions. [2023-11-19 08:03:57,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:03:57,045 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 46 transitions. [2023-11-19 08:03:57,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 46 transitions. [2023-11-19 08:03:57,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 21. [2023-11-19 08:03:57,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:57,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2023-11-19 08:03:57,049 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2023-11-19 08:03:57,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:03:57,051 INFO L428 stractBuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2023-11-19 08:03:57,052 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-19 08:03:57,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2023-11-19 08:03:57,053 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-11-19 08:03:57,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 08:03:57,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 08:03:57,055 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 1, 1, 1, 1] [2023-11-19 08:03:57,055 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-19 08:03:57,055 INFO L748 eck$LassoCheckResult]: Stem: 289#$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(18, 2); 290#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 282#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 283#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 291#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 284#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 285#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 286#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 287#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 298#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 297#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 296#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 294#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 295#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 293#L20-3 assume !(main_~i~0#1 < 100000); 292#L20-4 main_~i~0#1 := 0; 281#L26-3 [2023-11-19 08:03:57,056 INFO L750 eck$LassoCheckResult]: Loop: 281#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 288#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 280#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 281#L26-3 [2023-11-19 08:03:57,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:57,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1825864560, now seen corresponding path program 2 times [2023-11-19 08:03:57,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:57,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734438409] [2023-11-19 08:03:57,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:57,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:57,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:57,249 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:03:57,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:57,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734438409] [2023-11-19 08:03:57,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734438409] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:03:57,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151662797] [2023-11-19 08:03:57,250 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-19 08:03:57,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:03:57,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:03:57,252 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:03:57,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-19 08:03:57,313 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-19 08:03:57,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 08:03:57,314 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-19 08:03:57,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:03:57,347 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:03:57,347 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 08:03:57,434 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:03:57,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151662797] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 08:03:57,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 08:03:57,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-11-19 08:03:57,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650820875] [2023-11-19 08:03:57,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 08:03:57,435 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-19 08:03:57,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:57,436 INFO L85 PathProgramCache]: Analyzing trace with hash 59262, now seen corresponding path program 3 times [2023-11-19 08:03:57,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:57,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644039791] [2023-11-19 08:03:57,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:57,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:03:57,440 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:03:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:03:57,445 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:03:57,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:57,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-19 08:03:57,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-19 08:03:57,489 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 8 Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:57,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:03:57,675 INFO L93 Difference]: Finished difference Result 85 states and 106 transitions. [2023-11-19 08:03:57,675 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 106 transitions. [2023-11-19 08:03:57,686 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-11-19 08:03:57,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 85 states and 106 transitions. [2023-11-19 08:03:57,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2023-11-19 08:03:57,691 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2023-11-19 08:03:57,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 106 transitions. [2023-11-19 08:03:57,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:03:57,692 INFO L218 hiAutomatonCegarLoop]: Abstraction has 85 states and 106 transitions. [2023-11-19 08:03:57,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 106 transitions. [2023-11-19 08:03:57,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 39. [2023-11-19 08:03:57,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 38 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:57,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2023-11-19 08:03:57,702 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 51 transitions. [2023-11-19 08:03:57,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-19 08:03:57,704 INFO L428 stractBuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2023-11-19 08:03:57,704 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-19 08:03:57,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 51 transitions. [2023-11-19 08:03:57,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-11-19 08:03:57,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 08:03:57,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 08:03:57,707 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 1, 1, 1, 1] [2023-11-19 08:03:57,707 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-19 08:03:57,708 INFO L748 eck$LassoCheckResult]: Stem: 501#$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(18, 2); 502#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 494#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 495#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 503#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 496#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 497#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 498#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 499#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 528#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 527#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 526#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 525#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 524#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 523#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 522#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 521#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 520#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 519#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 518#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 517#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 516#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 515#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 514#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 513#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 512#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 511#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 510#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 509#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 508#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 506#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 507#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 505#L20-3 assume !(main_~i~0#1 < 100000); 504#L20-4 main_~i~0#1 := 0; 493#L26-3 [2023-11-19 08:03:57,708 INFO L750 eck$LassoCheckResult]: Loop: 493#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 500#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 492#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 493#L26-3 [2023-11-19 08:03:57,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:57,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1205177520, now seen corresponding path program 3 times [2023-11-19 08:03:57,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:57,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481434682] [2023-11-19 08:03:57,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:57,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:57,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:57,875 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-11-19 08:03:58,096 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:03:58,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:58,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481434682] [2023-11-19 08:03:58,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481434682] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:03:58,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309345140] [2023-11-19 08:03:58,097 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 08:03:58,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:03:58,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:03:58,099 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:03:58,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-19 08:03:58,273 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-11-19 08:03:58,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 08:03:58,275 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-19 08:03:58,277 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:03:58,380 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:03:58,381 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 08:03:58,692 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:03:58,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309345140] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 08:03:58,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 08:03:58,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2023-11-19 08:03:58,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431359993] [2023-11-19 08:03:58,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 08:03:58,695 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-19 08:03:58,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:58,695 INFO L85 PathProgramCache]: Analyzing trace with hash 59262, now seen corresponding path program 4 times [2023-11-19 08:03:58,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:58,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37092745] [2023-11-19 08:03:58,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:58,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:58,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:03:58,704 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:03:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:03:58,707 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:03:58,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:58,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-19 08:03:58,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2023-11-19 08:03:58,758 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. cyclomatic complexity: 14 Second operand has 25 states, 25 states have (on average 2.8) internal successors, (70), 25 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:59,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:03:59,081 INFO L93 Difference]: Finished difference Result 181 states and 226 transitions. [2023-11-19 08:03:59,081 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 181 states and 226 transitions. [2023-11-19 08:03:59,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-11-19 08:03:59,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 181 states to 181 states and 226 transitions. [2023-11-19 08:03:59,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2023-11-19 08:03:59,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2023-11-19 08:03:59,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 181 states and 226 transitions. [2023-11-19 08:03:59,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:03:59,089 INFO L218 hiAutomatonCegarLoop]: Abstraction has 181 states and 226 transitions. [2023-11-19 08:03:59,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states and 226 transitions. [2023-11-19 08:03:59,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 75. [2023-11-19 08:03:59,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.32) internal successors, (99), 74 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:59,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 99 transitions. [2023-11-19 08:03:59,097 INFO L240 hiAutomatonCegarLoop]: Abstraction has 75 states and 99 transitions. [2023-11-19 08:03:59,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-19 08:03:59,098 INFO L428 stractBuchiCegarLoop]: Abstraction has 75 states and 99 transitions. [2023-11-19 08:03:59,099 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-19 08:03:59,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 99 transitions. [2023-11-19 08:03:59,100 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-11-19 08:03:59,100 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 08:03:59,100 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 08:03:59,103 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 22, 1, 1, 1, 1] [2023-11-19 08:03:59,103 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-19 08:03:59,103 INFO L748 eck$LassoCheckResult]: Stem: 948#$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(18, 2); 949#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 942#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 943#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 947#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 944#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 945#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 940#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 941#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1010#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1009#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1008#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1007#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1006#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1005#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1004#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1003#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1002#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1001#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1000#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 999#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 998#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 997#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 996#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 995#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 994#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 993#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 992#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 991#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 990#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 989#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 988#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 987#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 986#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 985#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 984#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 983#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 982#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 981#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 980#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 979#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 978#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 977#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 976#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 975#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 974#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 973#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 972#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 971#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 970#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 969#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 968#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 967#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 966#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 965#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 964#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 963#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 962#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 961#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 960#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 959#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 958#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 957#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 956#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 955#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 954#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 952#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 953#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 951#L20-3 assume !(main_~i~0#1 < 100000); 950#L20-4 main_~i~0#1 := 0; 939#L26-3 [2023-11-19 08:03:59,104 INFO L750 eck$LassoCheckResult]: Loop: 939#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 946#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 938#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 939#L26-3 [2023-11-19 08:03:59,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:59,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1121042640, now seen corresponding path program 4 times [2023-11-19 08:03:59,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:59,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921260536] [2023-11-19 08:03:59,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:59,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:00,048 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:00,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:00,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921260536] [2023-11-19 08:04:00,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921260536] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:04:00,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427069100] [2023-11-19 08:04:00,050 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-19 08:04:00,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:04:00,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:04:00,055 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:04:00,056 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-19 08:04:00,228 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-19 08:04:00,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 08:04:00,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-19 08:04:00,239 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:04:00,380 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:00,380 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 08:04:01,424 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:01,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427069100] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 08:04:01,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 08:04:01,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2023-11-19 08:04:01,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796120638] [2023-11-19 08:04:01,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 08:04:01,430 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-19 08:04:01,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:01,430 INFO L85 PathProgramCache]: Analyzing trace with hash 59262, now seen corresponding path program 5 times [2023-11-19 08:04:01,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:01,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325352681] [2023-11-19 08:04:01,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:01,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:04:01,439 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:04:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:04:01,449 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:04:01,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:01,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-19 08:04:01,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2023-11-19 08:04:01,498 INFO L87 Difference]: Start difference. First operand 75 states and 99 transitions. cyclomatic complexity: 26 Second operand has 49 states, 49 states have (on average 2.8979591836734695) internal successors, (142), 49 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:02,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:04:02,351 INFO L93 Difference]: Finished difference Result 373 states and 466 transitions. [2023-11-19 08:04:02,352 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 373 states and 466 transitions. [2023-11-19 08:04:02,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-11-19 08:04:02,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 373 states to 373 states and 466 transitions. [2023-11-19 08:04:02,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 235 [2023-11-19 08:04:02,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 235 [2023-11-19 08:04:02,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 373 states and 466 transitions. [2023-11-19 08:04:02,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:02,363 INFO L218 hiAutomatonCegarLoop]: Abstraction has 373 states and 466 transitions. [2023-11-19 08:04:02,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states and 466 transitions. [2023-11-19 08:04:02,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 147. [2023-11-19 08:04:02,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 147 states have (on average 1.3265306122448979) internal successors, (195), 146 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:02,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 195 transitions. [2023-11-19 08:04:02,377 INFO L240 hiAutomatonCegarLoop]: Abstraction has 147 states and 195 transitions. [2023-11-19 08:04:02,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-11-19 08:04:02,378 INFO L428 stractBuchiCegarLoop]: Abstraction has 147 states and 195 transitions. [2023-11-19 08:04:02,379 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-19 08:04:02,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 147 states and 195 transitions. [2023-11-19 08:04:02,380 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-11-19 08:04:02,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 08:04:02,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 08:04:02,383 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 46, 46, 1, 1, 1, 1] [2023-11-19 08:04:02,383 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-19 08:04:02,384 INFO L748 eck$LassoCheckResult]: Stem: 1862#$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(18, 2); 1863#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 1854#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1855#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1861#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1856#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1857#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1858#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1859#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1996#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1995#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1994#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1993#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1992#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1991#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1990#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1989#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1988#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1987#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1986#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1985#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1984#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1983#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1982#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1981#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1980#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1979#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1978#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1977#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1976#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1975#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1974#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1973#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1972#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1971#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1970#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1969#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1968#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1967#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1966#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1965#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1964#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1963#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1962#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1961#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1960#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1959#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1958#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1957#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1956#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1955#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1954#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1953#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1952#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1951#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1950#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1949#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1948#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1947#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1946#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1945#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1944#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1943#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1942#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1941#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1940#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1939#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1938#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1937#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1936#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1935#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1934#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1933#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1932#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1931#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1930#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1929#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1928#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1927#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1926#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1925#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1924#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1923#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1922#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1921#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1920#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1919#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1918#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1917#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1916#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1915#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1914#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1913#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1912#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1911#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1910#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1909#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1908#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1907#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1906#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1905#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1904#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1903#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1902#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1901#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1900#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1899#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1898#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1897#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1896#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1895#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1894#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1893#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1892#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1891#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1890#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1889#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1888#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1887#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1886#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1885#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1884#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1883#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1882#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1881#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1880#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1879#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1878#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1877#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1876#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1875#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1874#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1873#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1872#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1871#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1870#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1869#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1868#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1866#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1867#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1865#L20-3 assume !(main_~i~0#1 < 100000); 1864#L20-4 main_~i~0#1 := 0; 1853#L26-3 [2023-11-19 08:04:02,384 INFO L750 eck$LassoCheckResult]: Loop: 1853#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1860#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 1852#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 1853#L26-3 [2023-11-19 08:04:02,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:02,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1788222416, now seen corresponding path program 5 times [2023-11-19 08:04:02,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:02,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373843305] [2023-11-19 08:04:02,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:02,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:02,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:05,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:05,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:05,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373843305] [2023-11-19 08:04:05,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373843305] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:04:05,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970493346] [2023-11-19 08:04:05,590 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-19 08:04:05,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:04:05,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:04:05,592 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:04:05,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb466c9e-404d-4340-ae76-972855fb2df1/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-19 08:04:30,424 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2023-11-19 08:04:30,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 08:04:30,443 INFO L262 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-19 08:04:30,450 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:04:30,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:30,768 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 08:04:34,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:34,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970493346] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 08:04:34,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 08:04:34,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2023-11-19 08:04:34,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567633498] [2023-11-19 08:04:34,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 08:04:34,329 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-19 08:04:34,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:34,329 INFO L85 PathProgramCache]: Analyzing trace with hash 59262, now seen corresponding path program 6 times [2023-11-19 08:04:34,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:34,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062913582] [2023-11-19 08:04:34,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:34,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:04:34,334 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:04:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:04:34,340 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:04:34,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:34,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2023-11-19 08:04:34,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2023-11-19 08:04:34,397 INFO L87 Difference]: Start difference. First operand 147 states and 195 transitions. cyclomatic complexity: 50 Second operand has 97 states, 97 states have (on average 2.948453608247423) internal successors, (286), 97 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:38,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:04:38,767 INFO L93 Difference]: Finished difference Result 757 states and 946 transitions. [2023-11-19 08:04:38,767 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 757 states and 946 transitions. [2023-11-19 08:04:38,775 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-11-19 08:04:38,781 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 757 states to 757 states and 946 transitions. [2023-11-19 08:04:38,781 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 475 [2023-11-19 08:04:38,782 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 475 [2023-11-19 08:04:38,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 757 states and 946 transitions. [2023-11-19 08:04:38,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:38,783 INFO L218 hiAutomatonCegarLoop]: Abstraction has 757 states and 946 transitions. [2023-11-19 08:04:38,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states and 946 transitions. [2023-11-19 08:04:38,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 291. [2023-11-19 08:04:38,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 291 states have (on average 1.3298969072164948) internal successors, (387), 290 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:38,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 387 transitions. [2023-11-19 08:04:38,801 INFO L240 hiAutomatonCegarLoop]: Abstraction has 291 states and 387 transitions. [2023-11-19 08:04:38,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2023-11-19 08:04:38,803 INFO L428 stractBuchiCegarLoop]: Abstraction has 291 states and 387 transitions. [2023-11-19 08:04:38,803 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-19 08:04:38,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 291 states and 387 transitions. [2023-11-19 08:04:38,805 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-11-19 08:04:38,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 08:04:38,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 08:04:38,812 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [94, 94, 94, 1, 1, 1, 1] [2023-11-19 08:04:38,812 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-19 08:04:38,813 INFO L748 eck$LassoCheckResult]: Stem: 3712#$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(18, 2); 3713#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 3706#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3707#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3711#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3708#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3709#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3704#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3705#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3990#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3989#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3988#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3987#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3986#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3985#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3984#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3983#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3982#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3981#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3980#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3979#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3978#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3977#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3976#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3975#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3974#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3973#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3972#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3971#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3970#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3969#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3968#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3967#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3966#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3965#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3964#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3963#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3962#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3961#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3960#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3959#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3958#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3957#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3956#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3955#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3954#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3953#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3952#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3951#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3950#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3949#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3948#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3947#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3946#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3945#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3944#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3943#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3942#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3941#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3940#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3939#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3938#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3937#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3936#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3935#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3934#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3933#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3932#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3931#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3930#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3929#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3928#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3927#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3926#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3925#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3924#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3923#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3922#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3921#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3920#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3919#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3918#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3917#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3916#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3915#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3914#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3913#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3912#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3911#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3910#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3909#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3908#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3907#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3906#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3905#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3904#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3903#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3902#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3901#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3900#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3899#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3898#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3897#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3896#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3895#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3894#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3893#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3892#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3891#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3890#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3889#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3888#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3887#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3886#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3885#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3884#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3883#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3882#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3881#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3880#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3879#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3878#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3877#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3876#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3875#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3874#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3873#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3872#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3871#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3870#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3869#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3868#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3867#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3866#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3865#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3864#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3863#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3862#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3861#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3860#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3859#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3858#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3857#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3856#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3855#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3854#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3853#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3852#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3851#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3850#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3849#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3848#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3847#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3846#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3845#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3844#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3843#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3842#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3841#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3840#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3839#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3838#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3837#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3836#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3835#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3834#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3833#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3832#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3831#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3830#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3829#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3828#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3827#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3826#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3825#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3824#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3823#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3822#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3821#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3820#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3819#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3818#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3817#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3816#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3815#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3814#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3813#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3812#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3811#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3810#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3809#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3808#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3807#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3806#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3805#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3804#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3803#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3802#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3801#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3800#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3799#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3798#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3797#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3796#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3795#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3794#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3793#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3792#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3791#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3790#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3789#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3788#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3787#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3786#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3785#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3784#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3783#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3782#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3781#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3780#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3779#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3778#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3777#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3776#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3775#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3774#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3773#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3772#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3771#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3770#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3769#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3768#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3767#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3766#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3765#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3764#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3763#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3762#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3761#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3760#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3759#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3758#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3757#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3756#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3755#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3754#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3753#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3752#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3751#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3750#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3749#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3748#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3747#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3746#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3745#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3744#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3743#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3742#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3741#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3740#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3739#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3738#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3737#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3736#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3735#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3734#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3733#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3732#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3731#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3730#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3729#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3728#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3727#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3726#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3725#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3724#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3723#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3722#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3721#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3720#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3719#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3718#L20-3 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3716#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3717#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3715#L20-3 assume !(main_~i~0#1 < 100000); 3714#L20-4 main_~i~0#1 := 0; 3703#L26-3 [2023-11-19 08:04:38,814 INFO L750 eck$LassoCheckResult]: Loop: 3703#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3710#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 3702#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 3703#L26-3 [2023-11-19 08:04:38,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:38,815 INFO L85 PathProgramCache]: Analyzing trace with hash 712364496, now seen corresponding path program 6 times [2023-11-19 08:04:38,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:38,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134355436] [2023-11-19 08:04:38,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:38,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat