./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted/LexIndexValue-Array-1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted/LexIndexValue-Array-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d69e4513fb8989bf305d8f9ce21862e8623f2a3d0c8146e8e7fb7e8c658a7eff --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:31:35,262 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:31:35,348 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-11-12 02:31:35,354 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:31:35,354 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:31:35,383 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:31:35,383 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:31:35,384 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:31:35,385 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:31:35,386 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:31:35,386 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:31:35,387 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-12 02:31:35,387 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-12 02:31:35,388 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-12 02:31:35,388 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-12 02:31:35,389 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-12 02:31:35,389 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-12 02:31:35,390 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:31:35,390 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-12 02:31:35,391 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:31:35,391 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:31:35,397 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-12 02:31:35,398 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-12 02:31:35,398 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-12 02:31:35,399 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 02:31:35,399 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:31:35,400 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-12 02:31:35,400 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:31:35,401 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:31:35,401 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:31:35,402 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:31:35,402 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:31:35,403 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-12 02:31:35,404 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_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d69e4513fb8989bf305d8f9ce21862e8623f2a3d0c8146e8e7fb7e8c658a7eff [2023-11-12 02:31:35,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:31:35,744 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:31:35,747 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:31:35,748 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:31:35,749 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:31:35,750 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/termination-crafted/LexIndexValue-Array-1.c [2023-11-12 02:31:38,964 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:31:39,174 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:31:39,175 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/sv-benchmarks/c/termination-crafted/LexIndexValue-Array-1.c [2023-11-12 02:31:39,183 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/data/1fb74cfeb/5b60e9f600294596afb98cfebb5f5862/FLAG38a46c47d [2023-11-12 02:31:39,198 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/data/1fb74cfeb/5b60e9f600294596afb98cfebb5f5862 [2023-11-12 02:31:39,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:31:39,203 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:31:39,205 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:31:39,205 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:31:39,211 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:31:39,212 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:31:39" (1/1) ... [2023-11-12 02:31:39,213 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@479d929c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:39, skipping insertion in model container [2023-11-12 02:31:39,213 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:31:39" (1/1) ... [2023-11-12 02:31:39,234 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:31:39,417 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:31:39,427 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:31:39,448 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:31:39,470 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:31:39,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:39 WrapperNode [2023-11-12 02:31:39,471 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:31:39,472 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:31:39,473 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:31:39,473 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:31:39,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:39" (1/1) ... [2023-11-12 02:31:39,488 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:39" (1/1) ... [2023-11-12 02:31:39,510 INFO L138 Inliner]: procedures = 8, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 48 [2023-11-12 02:31:39,511 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:31:39,512 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:31:39,512 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:31:39,512 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:31:39,520 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:39" (1/1) ... [2023-11-12 02:31:39,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:39" (1/1) ... [2023-11-12 02:31:39,522 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:39" (1/1) ... [2023-11-12 02:31:39,522 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:39" (1/1) ... [2023-11-12 02:31:39,542 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:39" (1/1) ... [2023-11-12 02:31:39,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:39" (1/1) ... [2023-11-12 02:31:39,551 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:39" (1/1) ... [2023-11-12 02:31:39,552 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:39" (1/1) ... [2023-11-12 02:31:39,554 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:31:39,555 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:31:39,556 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:31:39,556 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:31:39,557 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:39" (1/1) ... [2023-11-12 02:31:39,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:31:39,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:31:39,596 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:31:39,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-12 02:31:39,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:31:39,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:31:39,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:31:39,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 02:31:39,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:31:39,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:31:39,721 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:31:39,725 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:31:39,856 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:31:39,862 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:31:39,863 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-12 02:31:39,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:31:39 BoogieIcfgContainer [2023-11-12 02:31:39,865 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:31:39,866 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-12 02:31:39,866 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-12 02:31:39,870 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-12 02:31:39,871 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-12 02:31:39,872 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.11 02:31:39" (1/3) ... [2023-11-12 02:31:39,873 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39912cec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 02:31:39, skipping insertion in model container [2023-11-12 02:31:39,873 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-12 02:31:39,873 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:39" (2/3) ... [2023-11-12 02:31:39,874 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39912cec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 02:31:39, skipping insertion in model container [2023-11-12 02:31:39,874 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-12 02:31:39,874 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:31:39" (3/3) ... [2023-11-12 02:31:39,875 INFO L332 chiAutomizerObserver]: Analyzing ICFG LexIndexValue-Array-1.c [2023-11-12 02:31:39,951 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-12 02:31:39,953 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-12 02:31:39,954 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-12 02:31:39,954 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-12 02:31:39,954 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-12 02:31:39,954 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-12 02:31:39,955 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-12 02:31:39,955 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-12 02:31:39,960 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:39,979 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-11-12 02:31:39,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:31:39,979 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:31:39,984 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-12 02:31:39,984 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-12 02:31:39,984 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-12 02:31:39,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:39,986 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-11-12 02:31:39,986 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:31:39,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:31:39,987 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-12 02:31:39,987 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-12 02:31:39,993 INFO L748 eck$LassoCheckResult]: Stem: 11#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem2#1, main_#t~short3#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~k~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~k~0#1 := 0;main_~i~0#1 := 0; 8#L14-3true [2023-11-12 02:31:39,994 INFO L750 eck$LassoCheckResult]: Loop: 8#L14-3true assume !!(main_~i~0#1 < 1048);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; 13#L14-2true main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 8#L14-3true [2023-11-12 02:31:39,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:39,999 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-11-12 02:31:40,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:40,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655323333] [2023-11-12 02:31:40,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:40,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:40,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:31:40,162 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:31:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:31:40,193 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:31:40,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:40,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2023-11-12 02:31:40,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:40,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142682590] [2023-11-12 02:31:40,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:40,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:31:40,228 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:31:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:31:40,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:31:40,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:40,248 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2023-11-12 02:31:40,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:40,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280207717] [2023-11-12 02:31:40,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:40,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:40,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:31:40,277 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:31:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:31:40,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:31:40,553 INFO L210 LassoAnalysis]: Preferences: [2023-11-12 02:31:40,554 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-12 02:31:40,554 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-12 02:31:40,554 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-12 02:31:40,554 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-12 02:31:40,555 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:31:40,555 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-12 02:31:40,555 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-12 02:31:40,555 INFO L133 ssoRankerPreferences]: Filename of dumped script: LexIndexValue-Array-1.c_Iteration1_Lasso [2023-11-12 02:31:40,555 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-12 02:31:40,556 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-12 02:31:40,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:31:40,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:31:40,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:31:40,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:31:40,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:31:40,603 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:31:40,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:31:40,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:31:40,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:31:40,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:31:40,725 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:31:40,893 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-12 02:31:40,898 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-12 02:31:40,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:31:40,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:31:40,907 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:31:40,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-12 02:31:40,917 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-12 02:31:40,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:31:40,931 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:31:40,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:31:40,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:31:40,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:31:40,935 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:31:40,935 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:31:40,946 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:31:40,955 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2023-11-12 02:31:40,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:31:40,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:31:40,958 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:31:40,965 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-12 02:31:40,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:31:40,978 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:31:40,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:31:40,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:31:40,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:31:40,980 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:31:40,980 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:31:40,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-12 02:31:41,000 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:31:41,010 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-11-12 02:31:41,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:31:41,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:31:41,012 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:31:41,021 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-12 02:31:41,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:31:41,034 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:31:41,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:31:41,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:31:41,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:31:41,036 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:31:41,036 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:31:41,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-12 02:31:41,052 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:31:41,060 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-11-12 02:31:41,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:31:41,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:31:41,063 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:31:41,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-11-12 02:31:41,074 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-12 02:31:41,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:31:41,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:31:41,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:31:41,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:31:41,093 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-12 02:31:41,093 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-12 02:31:41,106 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:31:41,112 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-11-12 02:31:41,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:31:41,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:31:41,114 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:31:41,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-12 02:31:41,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-11-12 02:31:41,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:31:41,141 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:31:41,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:31:41,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:31:41,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:31:41,143 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:31:41,143 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:31:41,145 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:31:41,159 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-11-12 02:31:41,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:31:41,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:31:41,161 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:31:41,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-11-12 02:31:41,167 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-12 02:31:41,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:31:41,178 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:31:41,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:31:41,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:31:41,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:31:41,180 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:31:41,180 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:31:41,191 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:31:41,199 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-11-12 02:31:41,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:31:41,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:31:41,201 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:31:41,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-11-12 02:31:41,212 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-12 02:31:41,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:31:41,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:31:41,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:31:41,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:31:41,252 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-12 02:31:41,253 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-12 02:31:41,271 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:31:41,284 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-11-12 02:31:41,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:31:41,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:31:41,289 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:31:41,298 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-12 02:31:41,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-11-12 02:31:41,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:31:41,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:31:41,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:31:41,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:31:41,315 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-12 02:31:41,315 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-12 02:31:41,328 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:31:41,332 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-11-12 02:31:41,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:31:41,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:31:41,334 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:31:41,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-11-12 02:31:41,345 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-12 02:31:41,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:31:41,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:31:41,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:31:41,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:31:41,377 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-12 02:31:41,377 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-12 02:31:41,392 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-12 02:31:41,434 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2023-11-12 02:31:41,434 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2023-11-12 02:31:41,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:31:41,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:31:41,475 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:31:41,477 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-12 02:31:41,489 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-11-12 02:31:41,495 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-12 02:31:41,495 INFO L513 LassoAnalysis]: Proved termination. [2023-11-12 02:31:41,496 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = 2095*v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1 - 8*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2023-11-12 02:31:41,505 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-11-12 02:31:41,512 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-11-12 02:31:41,525 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[~#a~0!base] could not be translated [2023-11-12 02:31:41,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:41,558 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-12 02:31:41,559 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:31:41,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:41,574 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-12 02:31:41,575 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:31:41,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:31:41,654 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-11-12 02:31:41,656 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:41,715 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 25 states and 37 transitions. Complement of second has 8 states. [2023-11-12 02:31:41,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-12 02:31:41,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:41,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2023-11-12 02:31:41,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 2 letters. Loop has 2 letters. [2023-11-12 02:31:41,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-12 02:31:41,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 4 letters. Loop has 2 letters. [2023-11-12 02:31:41,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-12 02:31:41,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 2 letters. Loop has 4 letters. [2023-11-12 02:31:41,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-12 02:31:41,726 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 37 transitions. [2023-11-12 02:31:41,729 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-11-12 02:31:41,732 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 10 states and 14 transitions. [2023-11-12 02:31:41,733 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2023-11-12 02:31:41,734 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-11-12 02:31:41,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 14 transitions. [2023-11-12 02:31:41,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:31:41,735 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2023-11-12 02:31:41,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 14 transitions. [2023-11-12 02:31:41,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2023-11-12 02:31:41,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:41,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2023-11-12 02:31:41,761 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2023-11-12 02:31:41,762 INFO L428 stractBuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2023-11-12 02:31:41,762 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-12 02:31:41,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 14 transitions. [2023-11-12 02:31:41,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-11-12 02:31:41,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:31:41,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:31:41,763 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-11-12 02:31:41,763 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-12 02:31:41,763 INFO L748 eck$LassoCheckResult]: Stem: 86#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 87#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem2#1, main_#t~short3#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~k~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~k~0#1 := 0;main_~i~0#1 := 0; 88#L14-3 assume !(main_~i~0#1 < 1048); 84#L14-4 havoc main_~i~0#1; 81#L19-2 [2023-11-12 02:31:41,764 INFO L750 eck$LassoCheckResult]: Loop: 81#L19-2 main_#t~short3#1 := main_~k~0#1 < 1048; 82#L18-1 assume main_#t~short3#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);main_#t~short3#1 := main_#t~mem2#1 >= 0; 83#L18-3 assume !!main_#t~short3#1;havoc main_#t~mem2#1;havoc main_#t~short3#1;havoc main_#t~nondet4#1; 85#L19 assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_#t~post5#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 81#L19-2 [2023-11-12 02:31:41,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:41,764 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2023-11-12 02:31:41,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:41,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107955684] [2023-11-12 02:31:41,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:41,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:41,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:31:41,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:41,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107955684] [2023-11-12 02:31:41,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107955684] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:31:41,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:31:41,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:31:41,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156228102] [2023-11-12 02:31:41,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:31:41,856 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-12 02:31:41,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:41,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1573223, now seen corresponding path program 1 times [2023-11-12 02:31:41,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:41,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187941364] [2023-11-12 02:31:41,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:41,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:31:41,885 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:31:41,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:31:41,946 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:31:41,948 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-11-12 02:31:42,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:42,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:31:42,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:31:42,096 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:42,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:31:42,114 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2023-11-12 02:31:42,114 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 14 transitions. [2023-11-12 02:31:42,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-11-12 02:31:42,115 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 14 transitions. [2023-11-12 02:31:42,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-11-12 02:31:42,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-11-12 02:31:42,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2023-11-12 02:31:42,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:31:42,116 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 14 transitions. [2023-11-12 02:31:42,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2023-11-12 02:31:42,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2023-11-12 02:31:42,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:42,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2023-11-12 02:31:42,118 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2023-11-12 02:31:42,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:31:42,119 INFO L428 stractBuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2023-11-12 02:31:42,119 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-12 02:31:42,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2023-11-12 02:31:42,120 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-11-12 02:31:42,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:31:42,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:31:42,121 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-11-12 02:31:42,121 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-12 02:31:42,121 INFO L748 eck$LassoCheckResult]: Stem: 113#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 114#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem2#1, main_#t~short3#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~k~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~k~0#1 := 0;main_~i~0#1 := 0; 115#L14-3 assume !!(main_~i~0#1 < 1048);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; 116#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 117#L14-3 assume !(main_~i~0#1 < 1048); 111#L14-4 havoc main_~i~0#1; 108#L19-2 [2023-11-12 02:31:42,121 INFO L750 eck$LassoCheckResult]: Loop: 108#L19-2 main_#t~short3#1 := main_~k~0#1 < 1048; 109#L18-1 assume main_#t~short3#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);main_#t~short3#1 := main_#t~mem2#1 >= 0; 110#L18-3 assume !!main_#t~short3#1;havoc main_#t~mem2#1;havoc main_#t~short3#1;havoc main_#t~nondet4#1; 112#L19 assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_#t~post5#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 108#L19-2 [2023-11-12 02:31:42,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:42,122 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2023-11-12 02:31:42,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:42,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423150157] [2023-11-12 02:31:42,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:42,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:42,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:42,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:31:42,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:42,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423150157] [2023-11-12 02:31:42,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423150157] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:31:42,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791745838] [2023-11-12 02:31:42,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:42,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:31:42,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:31:42,217 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:31:42,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-12 02:31:42,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:42,274 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-12 02:31:42,275 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:31:42,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:31:42,297 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:31:42,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:31:42,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791745838] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:31:42,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:31:42,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-12 02:31:42,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142037708] [2023-11-12 02:31:42,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:31:42,328 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-12 02:31:42,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:42,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1573223, now seen corresponding path program 2 times [2023-11-12 02:31:42,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:42,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490009778] [2023-11-12 02:31:42,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:42,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:31:42,342 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:31:42,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:31:42,357 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:31:42,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:42,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:31:42,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:31:42,458 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:42,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:31:42,497 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2023-11-12 02:31:42,497 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2023-11-12 02:31:42,501 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-11-12 02:31:42,503 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 19 transitions. [2023-11-12 02:31:42,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-11-12 02:31:42,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-11-12 02:31:42,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2023-11-12 02:31:42,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:31:42,505 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2023-11-12 02:31:42,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2023-11-12 02:31:42,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-11-12 02:31:42,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:42,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2023-11-12 02:31:42,509 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2023-11-12 02:31:42,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:31:42,511 INFO L428 stractBuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2023-11-12 02:31:42,511 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-12 02:31:42,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2023-11-12 02:31:42,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-11-12 02:31:42,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:31:42,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:31:42,513 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2023-11-12 02:31:42,513 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-12 02:31:42,513 INFO L748 eck$LassoCheckResult]: Stem: 179#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 180#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem2#1, main_#t~short3#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~k~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~k~0#1 := 0;main_~i~0#1 := 0; 181#L14-3 assume !!(main_~i~0#1 < 1048);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; 182#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 183#L14-3 assume !!(main_~i~0#1 < 1048);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; 184#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 185#L14-3 assume !!(main_~i~0#1 < 1048);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; 189#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 188#L14-3 assume !!(main_~i~0#1 < 1048);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; 187#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 186#L14-3 assume !(main_~i~0#1 < 1048); 177#L14-4 havoc main_~i~0#1; 174#L19-2 [2023-11-12 02:31:42,514 INFO L750 eck$LassoCheckResult]: Loop: 174#L19-2 main_#t~short3#1 := main_~k~0#1 < 1048; 175#L18-1 assume main_#t~short3#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);main_#t~short3#1 := main_#t~mem2#1 >= 0; 176#L18-3 assume !!main_#t~short3#1;havoc main_#t~mem2#1;havoc main_#t~short3#1;havoc main_#t~nondet4#1; 178#L19 assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_#t~post5#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 174#L19-2 [2023-11-12 02:31:42,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:42,514 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2023-11-12 02:31:42,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:42,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616022091] [2023-11-12 02:31:42,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:42,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:42,658 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:31:42,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:42,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616022091] [2023-11-12 02:31:42,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616022091] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:31:42,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209701982] [2023-11-12 02:31:42,662 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-12 02:31:42,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:31:42,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:31:42,663 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:31:42,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-12 02:31:42,724 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-12 02:31:42,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 02:31:42,726 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-12 02:31:42,727 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:31:42,769 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:31:42,769 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:31:42,854 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:31:42,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209701982] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:31:42,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:31:42,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-11-12 02:31:42,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258777738] [2023-11-12 02:31:42,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:31:42,856 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-12 02:31:42,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:42,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1573223, now seen corresponding path program 3 times [2023-11-12 02:31:42,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:42,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728079040] [2023-11-12 02:31:42,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:42,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:31:42,866 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:31:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:31:42,876 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:31:42,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:42,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-12 02:31:42,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-12 02:31:42,988 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:43,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:31:43,057 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2023-11-12 02:31:43,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 31 transitions. [2023-11-12 02:31:43,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-11-12 02:31:43,066 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 31 transitions. [2023-11-12 02:31:43,066 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-11-12 02:31:43,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-11-12 02:31:43,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2023-11-12 02:31:43,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:31:43,066 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 31 transitions. [2023-11-12 02:31:43,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2023-11-12 02:31:43,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-11-12 02:31:43,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:43,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2023-11-12 02:31:43,072 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 31 transitions. [2023-11-12 02:31:43,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-12 02:31:43,074 INFO L428 stractBuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2023-11-12 02:31:43,074 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-12 02:31:43,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 31 transitions. [2023-11-12 02:31:43,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-11-12 02:31:43,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:31:43,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:31:43,078 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2023-11-12 02:31:43,078 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-12 02:31:43,078 INFO L748 eck$LassoCheckResult]: Stem: 305#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 306#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem2#1, main_#t~short3#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~k~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~k~0#1 := 0;main_~i~0#1 := 0; 307#L14-3 assume !!(main_~i~0#1 < 1048);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; 308#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 309#L14-3 assume !!(main_~i~0#1 < 1048);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; 310#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 311#L14-3 assume !!(main_~i~0#1 < 1048);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; 327#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 326#L14-3 assume !!(main_~i~0#1 < 1048);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; 325#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 324#L14-3 assume !!(main_~i~0#1 < 1048);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; 323#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 322#L14-3 assume !!(main_~i~0#1 < 1048);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; 321#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 320#L14-3 assume !!(main_~i~0#1 < 1048);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; 319#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 318#L14-3 assume !!(main_~i~0#1 < 1048);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; 317#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 316#L14-3 assume !!(main_~i~0#1 < 1048);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; 315#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 314#L14-3 assume !!(main_~i~0#1 < 1048);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; 313#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 312#L14-3 assume !(main_~i~0#1 < 1048); 303#L14-4 havoc main_~i~0#1; 300#L19-2 [2023-11-12 02:31:43,079 INFO L750 eck$LassoCheckResult]: Loop: 300#L19-2 main_#t~short3#1 := main_~k~0#1 < 1048; 301#L18-1 assume main_#t~short3#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);main_#t~short3#1 := main_#t~mem2#1 >= 0; 302#L18-3 assume !!main_#t~short3#1;havoc main_#t~mem2#1;havoc main_#t~short3#1;havoc main_#t~nondet4#1; 304#L19 assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_#t~post5#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 300#L19-2 [2023-11-12 02:31:43,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:43,079 INFO L85 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 3 times [2023-11-12 02:31:43,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:43,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133859745] [2023-11-12 02:31:43,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:43,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:43,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:43,365 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:31:43,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:43,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133859745] [2023-11-12 02:31:43,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133859745] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:31:43,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554546530] [2023-11-12 02:31:43,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-12 02:31:43,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:31:43,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:31:43,370 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:31:43,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-12 02:31:43,509 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-11-12 02:31:43,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 02:31:43,511 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-12 02:31:43,513 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:31:43,617 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:31:43,617 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:31:43,901 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:31:43,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554546530] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:31:43,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:31:43,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2023-11-12 02:31:43,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865691897] [2023-11-12 02:31:43,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:31:43,902 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-12 02:31:43,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:43,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1573223, now seen corresponding path program 4 times [2023-11-12 02:31:43,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:43,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334708365] [2023-11-12 02:31:43,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:43,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:43,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:31:43,909 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:31:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:31:43,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:31:44,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:44,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-12 02:31:44,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2023-11-12 02:31:44,005 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. cyclomatic complexity: 5 Second operand has 25 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:44,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:31:44,120 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2023-11-12 02:31:44,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 55 transitions. [2023-11-12 02:31:44,121 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-11-12 02:31:44,122 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 55 transitions. [2023-11-12 02:31:44,122 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-11-12 02:31:44,123 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-11-12 02:31:44,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 55 transitions. [2023-11-12 02:31:44,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:31:44,123 INFO L218 hiAutomatonCegarLoop]: Abstraction has 52 states and 55 transitions. [2023-11-12 02:31:44,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 55 transitions. [2023-11-12 02:31:44,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-11-12 02:31:44,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:44,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2023-11-12 02:31:44,128 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 55 transitions. [2023-11-12 02:31:44,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-12 02:31:44,129 INFO L428 stractBuchiCegarLoop]: Abstraction has 52 states and 55 transitions. [2023-11-12 02:31:44,129 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-12 02:31:44,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 55 transitions. [2023-11-12 02:31:44,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-11-12 02:31:44,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:31:44,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:31:44,133 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 1, 1, 1, 1] [2023-11-12 02:31:44,133 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-12 02:31:44,134 INFO L748 eck$LassoCheckResult]: Stem: 551#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 552#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem2#1, main_#t~short3#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~k~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~k~0#1 := 0;main_~i~0#1 := 0; 553#L14-3 assume !!(main_~i~0#1 < 1048);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; 554#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 555#L14-3 assume !!(main_~i~0#1 < 1048);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; 556#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 557#L14-3 assume !!(main_~i~0#1 < 1048);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; 597#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 596#L14-3 assume !!(main_~i~0#1 < 1048);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; 595#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 594#L14-3 assume !!(main_~i~0#1 < 1048);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; 593#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 592#L14-3 assume !!(main_~i~0#1 < 1048);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; 591#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 590#L14-3 assume !!(main_~i~0#1 < 1048);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; 589#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 588#L14-3 assume !!(main_~i~0#1 < 1048);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; 587#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 586#L14-3 assume !!(main_~i~0#1 < 1048);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; 585#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 584#L14-3 assume !!(main_~i~0#1 < 1048);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; 583#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 582#L14-3 assume !!(main_~i~0#1 < 1048);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; 581#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 580#L14-3 assume !!(main_~i~0#1 < 1048);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; 579#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 578#L14-3 assume !!(main_~i~0#1 < 1048);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; 577#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 576#L14-3 assume !!(main_~i~0#1 < 1048);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; 575#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 574#L14-3 assume !!(main_~i~0#1 < 1048);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; 573#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 572#L14-3 assume !!(main_~i~0#1 < 1048);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; 571#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 570#L14-3 assume !!(main_~i~0#1 < 1048);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; 569#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 568#L14-3 assume !!(main_~i~0#1 < 1048);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; 567#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 566#L14-3 assume !!(main_~i~0#1 < 1048);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; 565#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 564#L14-3 assume !!(main_~i~0#1 < 1048);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; 563#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 562#L14-3 assume !!(main_~i~0#1 < 1048);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; 561#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 560#L14-3 assume !!(main_~i~0#1 < 1048);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; 559#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 558#L14-3 assume !(main_~i~0#1 < 1048); 549#L14-4 havoc main_~i~0#1; 546#L19-2 [2023-11-12 02:31:44,134 INFO L750 eck$LassoCheckResult]: Loop: 546#L19-2 main_#t~short3#1 := main_~k~0#1 < 1048; 547#L18-1 assume main_#t~short3#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);main_#t~short3#1 := main_#t~mem2#1 >= 0; 548#L18-3 assume !!main_#t~short3#1;havoc main_#t~mem2#1;havoc main_#t~short3#1;havoc main_#t~nondet4#1; 550#L19 assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_#t~post5#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 546#L19-2 [2023-11-12 02:31:44,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:44,135 INFO L85 PathProgramCache]: Analyzing trace with hash 828161207, now seen corresponding path program 4 times [2023-11-12 02:31:44,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:44,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530450452] [2023-11-12 02:31:44,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:44,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:44,916 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:31:44,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:44,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530450452] [2023-11-12 02:31:44,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530450452] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:31:44,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406508627] [2023-11-12 02:31:44,917 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-12 02:31:44,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:31:44,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:31:44,928 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:31:44,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-12 02:31:45,060 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-12 02:31:45,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 02:31:45,062 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-12 02:31:45,067 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:31:45,191 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:31:45,191 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:31:46,187 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:31:46,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406508627] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:31:46,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:31:46,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2023-11-12 02:31:46,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723168209] [2023-11-12 02:31:46,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:31:46,188 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-12 02:31:46,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:46,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1573223, now seen corresponding path program 5 times [2023-11-12 02:31:46,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:46,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388999880] [2023-11-12 02:31:46,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:46,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:46,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:31:46,195 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:31:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:31:46,199 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:31:46,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:46,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-12 02:31:46,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2023-11-12 02:31:46,288 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. cyclomatic complexity: 5 Second operand has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 49 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:46,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:31:46,525 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2023-11-12 02:31:46,525 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 103 transitions. [2023-11-12 02:31:46,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-11-12 02:31:46,531 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 100 states and 103 transitions. [2023-11-12 02:31:46,531 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-11-12 02:31:46,532 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-11-12 02:31:46,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 103 transitions. [2023-11-12 02:31:46,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:31:46,535 INFO L218 hiAutomatonCegarLoop]: Abstraction has 100 states and 103 transitions. [2023-11-12 02:31:46,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 103 transitions. [2023-11-12 02:31:46,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-11-12 02:31:46,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 100 states have (on average 1.03) internal successors, (103), 99 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:46,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 103 transitions. [2023-11-12 02:31:46,554 INFO L240 hiAutomatonCegarLoop]: Abstraction has 100 states and 103 transitions. [2023-11-12 02:31:46,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-11-12 02:31:46,555 INFO L428 stractBuchiCegarLoop]: Abstraction has 100 states and 103 transitions. [2023-11-12 02:31:46,555 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-12 02:31:46,555 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 103 transitions. [2023-11-12 02:31:46,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-11-12 02:31:46,557 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:31:46,557 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:31:46,563 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 46, 1, 1, 1, 1] [2023-11-12 02:31:46,563 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-12 02:31:46,563 INFO L748 eck$LassoCheckResult]: Stem: 1037#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1038#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem2#1, main_#t~short3#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~k~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~k~0#1 := 0;main_~i~0#1 := 0; 1039#L14-3 assume !!(main_~i~0#1 < 1048);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; 1040#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1041#L14-3 assume !!(main_~i~0#1 < 1048);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; 1042#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1043#L14-3 assume !!(main_~i~0#1 < 1048);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; 1131#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1130#L14-3 assume !!(main_~i~0#1 < 1048);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; 1129#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1128#L14-3 assume !!(main_~i~0#1 < 1048);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; 1127#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1126#L14-3 assume !!(main_~i~0#1 < 1048);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; 1125#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1124#L14-3 assume !!(main_~i~0#1 < 1048);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; 1123#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1122#L14-3 assume !!(main_~i~0#1 < 1048);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; 1121#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1120#L14-3 assume !!(main_~i~0#1 < 1048);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; 1119#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1118#L14-3 assume !!(main_~i~0#1 < 1048);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; 1117#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1116#L14-3 assume !!(main_~i~0#1 < 1048);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; 1115#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1114#L14-3 assume !!(main_~i~0#1 < 1048);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; 1113#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1112#L14-3 assume !!(main_~i~0#1 < 1048);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; 1111#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1110#L14-3 assume !!(main_~i~0#1 < 1048);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; 1109#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1108#L14-3 assume !!(main_~i~0#1 < 1048);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; 1107#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1106#L14-3 assume !!(main_~i~0#1 < 1048);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; 1105#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1104#L14-3 assume !!(main_~i~0#1 < 1048);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; 1103#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1102#L14-3 assume !!(main_~i~0#1 < 1048);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; 1101#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1100#L14-3 assume !!(main_~i~0#1 < 1048);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; 1099#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1098#L14-3 assume !!(main_~i~0#1 < 1048);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; 1097#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1096#L14-3 assume !!(main_~i~0#1 < 1048);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; 1095#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1094#L14-3 assume !!(main_~i~0#1 < 1048);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; 1093#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1092#L14-3 assume !!(main_~i~0#1 < 1048);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; 1091#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1090#L14-3 assume !!(main_~i~0#1 < 1048);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; 1089#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1088#L14-3 assume !!(main_~i~0#1 < 1048);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; 1087#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1086#L14-3 assume !!(main_~i~0#1 < 1048);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; 1085#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1084#L14-3 assume !!(main_~i~0#1 < 1048);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; 1083#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1082#L14-3 assume !!(main_~i~0#1 < 1048);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; 1081#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1080#L14-3 assume !!(main_~i~0#1 < 1048);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; 1079#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1078#L14-3 assume !!(main_~i~0#1 < 1048);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; 1077#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1076#L14-3 assume !!(main_~i~0#1 < 1048);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; 1075#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1074#L14-3 assume !!(main_~i~0#1 < 1048);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; 1073#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1072#L14-3 assume !!(main_~i~0#1 < 1048);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; 1071#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1070#L14-3 assume !!(main_~i~0#1 < 1048);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; 1069#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1068#L14-3 assume !!(main_~i~0#1 < 1048);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; 1067#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1066#L14-3 assume !!(main_~i~0#1 < 1048);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; 1065#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1064#L14-3 assume !!(main_~i~0#1 < 1048);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; 1063#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1062#L14-3 assume !!(main_~i~0#1 < 1048);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; 1061#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1060#L14-3 assume !!(main_~i~0#1 < 1048);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; 1059#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1058#L14-3 assume !!(main_~i~0#1 < 1048);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; 1057#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1056#L14-3 assume !!(main_~i~0#1 < 1048);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; 1055#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1054#L14-3 assume !!(main_~i~0#1 < 1048);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; 1053#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1052#L14-3 assume !!(main_~i~0#1 < 1048);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; 1051#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1050#L14-3 assume !!(main_~i~0#1 < 1048);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; 1049#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1048#L14-3 assume !!(main_~i~0#1 < 1048);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; 1047#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1046#L14-3 assume !!(main_~i~0#1 < 1048);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; 1045#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 1044#L14-3 assume !(main_~i~0#1 < 1048); 1035#L14-4 havoc main_~i~0#1; 1032#L19-2 [2023-11-12 02:31:46,564 INFO L750 eck$LassoCheckResult]: Loop: 1032#L19-2 main_#t~short3#1 := main_~k~0#1 < 1048; 1033#L18-1 assume main_#t~short3#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);main_#t~short3#1 := main_#t~mem2#1 >= 0; 1034#L18-3 assume !!main_#t~short3#1;havoc main_#t~mem2#1;havoc main_#t~short3#1;havoc main_#t~nondet4#1; 1036#L19 assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_#t~post5#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1032#L19-2 [2023-11-12 02:31:46,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:46,564 INFO L85 PathProgramCache]: Analyzing trace with hash 830581479, now seen corresponding path program 5 times [2023-11-12 02:31:46,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:46,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37543418] [2023-11-12 02:31:46,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:46,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:46,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:49,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:31:49,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:49,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37543418] [2023-11-12 02:31:49,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37543418] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:31:49,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553412763] [2023-11-12 02:31:49,185 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-12 02:31:49,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:31:49,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:31:49,194 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:31:49,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c30e14f-b25f-4bcc-9382-aa46cc5f8628/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-12 02:32:34,468 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2023-11-12 02:32:34,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 02:32:34,498 INFO L262 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-12 02:32:34,505 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:32:34,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:32:34,722 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:32:38,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:32:38,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553412763] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:32:38,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:32:38,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2023-11-12 02:32:38,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134434292] [2023-11-12 02:32:38,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:32:38,347 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-12 02:32:38,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:32:38,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1573223, now seen corresponding path program 6 times [2023-11-12 02:32:38,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:32:38,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166230450] [2023-11-12 02:32:38,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:32:38,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:32:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:32:38,355 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:32:38,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:32:38,363 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:32:38,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:32:38,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2023-11-12 02:32:38,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2023-11-12 02:32:38,446 INFO L87 Difference]: Start difference. First operand 100 states and 103 transitions. cyclomatic complexity: 5 Second operand has 97 states, 97 states have (on average 1.9896907216494846) internal successors, (193), 97 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:32:38,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:32:38,911 INFO L93 Difference]: Finished difference Result 196 states and 199 transitions. [2023-11-12 02:32:38,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 196 states and 199 transitions. [2023-11-12 02:32:38,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-11-12 02:32:38,923 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 196 states to 196 states and 199 transitions. [2023-11-12 02:32:38,923 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-11-12 02:32:38,923 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-11-12 02:32:38,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 199 transitions. [2023-11-12 02:32:38,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:32:38,930 INFO L218 hiAutomatonCegarLoop]: Abstraction has 196 states and 199 transitions. [2023-11-12 02:32:38,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 199 transitions. [2023-11-12 02:32:38,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2023-11-12 02:32:38,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 196 states have (on average 1.0153061224489797) internal successors, (199), 195 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:32:38,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 199 transitions. [2023-11-12 02:32:38,950 INFO L240 hiAutomatonCegarLoop]: Abstraction has 196 states and 199 transitions. [2023-11-12 02:32:38,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2023-11-12 02:32:38,952 INFO L428 stractBuchiCegarLoop]: Abstraction has 196 states and 199 transitions. [2023-11-12 02:32:38,952 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-12 02:32:38,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 196 states and 199 transitions. [2023-11-12 02:32:38,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-11-12 02:32:38,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:32:38,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:32:38,963 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [94, 94, 1, 1, 1, 1] [2023-11-12 02:32:38,967 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-12 02:32:38,968 INFO L748 eck$LassoCheckResult]: Stem: 2003#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2004#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post0#1, main_~i~0#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem2#1, main_#t~short3#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~k~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~k~0#1 := 0;main_~i~0#1 := 0; 2005#L14-3 assume !!(main_~i~0#1 < 1048);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; 2006#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2007#L14-3 assume !!(main_~i~0#1 < 1048);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; 2008#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2009#L14-3 assume !!(main_~i~0#1 < 1048);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; 2193#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2192#L14-3 assume !!(main_~i~0#1 < 1048);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; 2191#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2190#L14-3 assume !!(main_~i~0#1 < 1048);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; 2189#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2188#L14-3 assume !!(main_~i~0#1 < 1048);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; 2187#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2186#L14-3 assume !!(main_~i~0#1 < 1048);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; 2185#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2184#L14-3 assume !!(main_~i~0#1 < 1048);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; 2183#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2182#L14-3 assume !!(main_~i~0#1 < 1048);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; 2181#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2180#L14-3 assume !!(main_~i~0#1 < 1048);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; 2179#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2178#L14-3 assume !!(main_~i~0#1 < 1048);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; 2177#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2176#L14-3 assume !!(main_~i~0#1 < 1048);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; 2175#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2174#L14-3 assume !!(main_~i~0#1 < 1048);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; 2173#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2172#L14-3 assume !!(main_~i~0#1 < 1048);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; 2171#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2170#L14-3 assume !!(main_~i~0#1 < 1048);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; 2169#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2168#L14-3 assume !!(main_~i~0#1 < 1048);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; 2167#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2166#L14-3 assume !!(main_~i~0#1 < 1048);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; 2165#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2164#L14-3 assume !!(main_~i~0#1 < 1048);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; 2163#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2162#L14-3 assume !!(main_~i~0#1 < 1048);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; 2161#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2160#L14-3 assume !!(main_~i~0#1 < 1048);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; 2159#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2158#L14-3 assume !!(main_~i~0#1 < 1048);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; 2157#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2156#L14-3 assume !!(main_~i~0#1 < 1048);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; 2155#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2154#L14-3 assume !!(main_~i~0#1 < 1048);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; 2153#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2152#L14-3 assume !!(main_~i~0#1 < 1048);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; 2151#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2150#L14-3 assume !!(main_~i~0#1 < 1048);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; 2149#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2148#L14-3 assume !!(main_~i~0#1 < 1048);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; 2147#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2146#L14-3 assume !!(main_~i~0#1 < 1048);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; 2145#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2144#L14-3 assume !!(main_~i~0#1 < 1048);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; 2143#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2142#L14-3 assume !!(main_~i~0#1 < 1048);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; 2141#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2140#L14-3 assume !!(main_~i~0#1 < 1048);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; 2139#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2138#L14-3 assume !!(main_~i~0#1 < 1048);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; 2137#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2136#L14-3 assume !!(main_~i~0#1 < 1048);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; 2135#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2134#L14-3 assume !!(main_~i~0#1 < 1048);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; 2133#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2132#L14-3 assume !!(main_~i~0#1 < 1048);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; 2131#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2130#L14-3 assume !!(main_~i~0#1 < 1048);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; 2129#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2128#L14-3 assume !!(main_~i~0#1 < 1048);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; 2127#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2126#L14-3 assume !!(main_~i~0#1 < 1048);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; 2125#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2124#L14-3 assume !!(main_~i~0#1 < 1048);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; 2123#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2122#L14-3 assume !!(main_~i~0#1 < 1048);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; 2121#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2120#L14-3 assume !!(main_~i~0#1 < 1048);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; 2119#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2118#L14-3 assume !!(main_~i~0#1 < 1048);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; 2117#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2116#L14-3 assume !!(main_~i~0#1 < 1048);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; 2115#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2114#L14-3 assume !!(main_~i~0#1 < 1048);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; 2113#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2112#L14-3 assume !!(main_~i~0#1 < 1048);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; 2111#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2110#L14-3 assume !!(main_~i~0#1 < 1048);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; 2109#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2108#L14-3 assume !!(main_~i~0#1 < 1048);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; 2107#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2106#L14-3 assume !!(main_~i~0#1 < 1048);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; 2105#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2104#L14-3 assume !!(main_~i~0#1 < 1048);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; 2103#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2102#L14-3 assume !!(main_~i~0#1 < 1048);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; 2101#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2100#L14-3 assume !!(main_~i~0#1 < 1048);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; 2099#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2098#L14-3 assume !!(main_~i~0#1 < 1048);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; 2097#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2096#L14-3 assume !!(main_~i~0#1 < 1048);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; 2095#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2094#L14-3 assume !!(main_~i~0#1 < 1048);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; 2093#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2092#L14-3 assume !!(main_~i~0#1 < 1048);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; 2091#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2090#L14-3 assume !!(main_~i~0#1 < 1048);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; 2089#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2088#L14-3 assume !!(main_~i~0#1 < 1048);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; 2087#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2086#L14-3 assume !!(main_~i~0#1 < 1048);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; 2085#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2084#L14-3 assume !!(main_~i~0#1 < 1048);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; 2083#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2082#L14-3 assume !!(main_~i~0#1 < 1048);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; 2081#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2080#L14-3 assume !!(main_~i~0#1 < 1048);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; 2079#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2078#L14-3 assume !!(main_~i~0#1 < 1048);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; 2077#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2076#L14-3 assume !!(main_~i~0#1 < 1048);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; 2075#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2074#L14-3 assume !!(main_~i~0#1 < 1048);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; 2073#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2072#L14-3 assume !!(main_~i~0#1 < 1048);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; 2071#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2070#L14-3 assume !!(main_~i~0#1 < 1048);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; 2069#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2068#L14-3 assume !!(main_~i~0#1 < 1048);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; 2067#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2066#L14-3 assume !!(main_~i~0#1 < 1048);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; 2065#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2064#L14-3 assume !!(main_~i~0#1 < 1048);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; 2063#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2062#L14-3 assume !!(main_~i~0#1 < 1048);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; 2061#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2060#L14-3 assume !!(main_~i~0#1 < 1048);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; 2059#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2058#L14-3 assume !!(main_~i~0#1 < 1048);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; 2057#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2056#L14-3 assume !!(main_~i~0#1 < 1048);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; 2055#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2054#L14-3 assume !!(main_~i~0#1 < 1048);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; 2053#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2052#L14-3 assume !!(main_~i~0#1 < 1048);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; 2051#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2050#L14-3 assume !!(main_~i~0#1 < 1048);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; 2049#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2048#L14-3 assume !!(main_~i~0#1 < 1048);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; 2047#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2046#L14-3 assume !!(main_~i~0#1 < 1048);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; 2045#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2044#L14-3 assume !!(main_~i~0#1 < 1048);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; 2043#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2042#L14-3 assume !!(main_~i~0#1 < 1048);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; 2041#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2040#L14-3 assume !!(main_~i~0#1 < 1048);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; 2039#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2038#L14-3 assume !!(main_~i~0#1 < 1048);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; 2037#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2036#L14-3 assume !!(main_~i~0#1 < 1048);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; 2035#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2034#L14-3 assume !!(main_~i~0#1 < 1048);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; 2033#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2032#L14-3 assume !!(main_~i~0#1 < 1048);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; 2031#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2030#L14-3 assume !!(main_~i~0#1 < 1048);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; 2029#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2028#L14-3 assume !!(main_~i~0#1 < 1048);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; 2027#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2026#L14-3 assume !!(main_~i~0#1 < 1048);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; 2025#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2024#L14-3 assume !!(main_~i~0#1 < 1048);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; 2023#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2022#L14-3 assume !!(main_~i~0#1 < 1048);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; 2021#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2020#L14-3 assume !!(main_~i~0#1 < 1048);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; 2019#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2018#L14-3 assume !!(main_~i~0#1 < 1048);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; 2017#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2016#L14-3 assume !!(main_~i~0#1 < 1048);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; 2015#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2014#L14-3 assume !!(main_~i~0#1 < 1048);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; 2013#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2012#L14-3 assume !!(main_~i~0#1 < 1048);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; 2011#L14-2 main_#t~post0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post0#1;havoc main_#t~post0#1; 2010#L14-3 assume !(main_~i~0#1 < 1048); 2001#L14-4 havoc main_~i~0#1; 1998#L19-2 [2023-11-12 02:32:38,972 INFO L750 eck$LassoCheckResult]: Loop: 1998#L19-2 main_#t~short3#1 := main_~k~0#1 < 1048; 1999#L18-1 assume main_#t~short3#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);main_#t~short3#1 := main_#t~mem2#1 >= 0; 2000#L18-3 assume !!main_#t~short3#1;havoc main_#t~mem2#1;havoc main_#t~short3#1;havoc main_#t~nondet4#1; 2002#L19 assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_#t~post5#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1998#L19-2 [2023-11-12 02:32:38,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:32:38,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1165371207, now seen corresponding path program 6 times [2023-11-12 02:32:38,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:32:38,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203735560] [2023-11-12 02:32:38,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:32:38,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:32:39,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat