./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted/Arrays03-ValueRestictsIndex-2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 527bcce2 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted/Arrays03-ValueRestictsIndex-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx --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 302c18c494f9017ecbb07643194b1d54ba0a6bba467355d4f775638dea57e539 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 22:25:29,286 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:25:29,407 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-11-21 22:25:29,415 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:25:29,416 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:25:29,453 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:25:29,454 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:25:29,455 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:25:29,456 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-21 22:25:29,457 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-21 22:25:29,458 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:25:29,459 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:25:29,460 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:25:29,461 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-21 22:25:29,462 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-21 22:25:29,462 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-21 22:25:29,463 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-21 22:25:29,464 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-21 22:25:29,465 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-21 22:25:29,465 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:25:29,466 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-21 22:25:29,472 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:25:29,472 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:25:29,473 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-21 22:25:29,474 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-21 22:25:29,474 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-21 22:25:29,475 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 22:25:29,476 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 22:25:29,476 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-21 22:25:29,477 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:25:29,478 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:25:29,480 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:25:29,480 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:25:29,481 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 22:25:29,481 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-21 22:25:29,482 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_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/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_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx 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 -> 302c18c494f9017ecbb07643194b1d54ba0a6bba467355d4f775638dea57e539 [2023-11-21 22:25:29,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:25:29,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:25:29,912 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:25:29,913 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:25:29,914 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:25:29,916 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/termination-crafted/Arrays03-ValueRestictsIndex-2.c [2023-11-21 22:25:33,586 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:25:33,929 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:25:33,930 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/sv-benchmarks/c/termination-crafted/Arrays03-ValueRestictsIndex-2.c [2023-11-21 22:25:33,939 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/data/90bcb8b68/1e383f7afd3a4ef7a1de3bd94e6fa84b/FLAGda1981681 [2023-11-21 22:25:33,959 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/data/90bcb8b68/1e383f7afd3a4ef7a1de3bd94e6fa84b [2023-11-21 22:25:33,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:25:33,968 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:25:33,973 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:25:33,973 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:25:33,981 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:25:33,982 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:25:33" (1/1) ... [2023-11-21 22:25:33,983 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37330ab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:25:33, skipping insertion in model container [2023-11-21 22:25:33,984 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:25:33" (1/1) ... [2023-11-21 22:25:34,006 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:25:34,213 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:25:34,220 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:25:34,240 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:25:34,262 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:25:34,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:25:34 WrapperNode [2023-11-21 22:25:34,263 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:25:34,264 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:25:34,265 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:25:34,265 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:25:34,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:25:34" (1/1) ... [2023-11-21 22:25:34,288 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:25:34" (1/1) ... [2023-11-21 22:25:34,318 INFO L138 Inliner]: procedures = 8, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 48 [2023-11-21 22:25:34,318 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:25:34,319 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:25:34,319 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:25:34,320 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:25:34,333 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:25:34" (1/1) ... [2023-11-21 22:25:34,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:25:34" (1/1) ... [2023-11-21 22:25:34,352 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:25:34" (1/1) ... [2023-11-21 22:25:34,364 INFO L187 HeapSplitter]: Split 3 memory accesses to 1 slices as follows [3] [2023-11-21 22:25:34,366 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:25:34" (1/1) ... [2023-11-21 22:25:34,366 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:25:34" (1/1) ... [2023-11-21 22:25:34,379 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:25:34" (1/1) ... [2023-11-21 22:25:34,384 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:25:34" (1/1) ... [2023-11-21 22:25:34,385 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:25:34" (1/1) ... [2023-11-21 22:25:34,386 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:25:34" (1/1) ... [2023-11-21 22:25:34,389 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:25:34,390 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:25:34,390 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:25:34,391 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:25:34,392 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:25:34" (1/1) ... [2023-11-21 22:25:34,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:25:34,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:25:34,440 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:25:34,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-21 22:25:34,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-21 22:25:34,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:25:34,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:25:34,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-21 22:25:34,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 22:25:34,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 22:25:34,578 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:25:34,581 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:25:34,786 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:25:34,797 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:25:34,798 INFO L308 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-21 22:25:34,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:25:34 BoogieIcfgContainer [2023-11-21 22:25:34,804 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:25:34,805 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-21 22:25:34,806 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-21 22:25:34,812 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-21 22:25:34,813 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-21 22:25:34,813 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.11 10:25:33" (1/3) ... [2023-11-21 22:25:34,815 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6db2e19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 10:25:34, skipping insertion in model container [2023-11-21 22:25:34,815 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-21 22:25:34,815 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:25:34" (2/3) ... [2023-11-21 22:25:34,819 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6db2e19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 10:25:34, skipping insertion in model container [2023-11-21 22:25:34,820 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-21 22:25:34,821 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:25:34" (3/3) ... [2023-11-21 22:25:34,823 INFO L332 chiAutomizerObserver]: Analyzing ICFG Arrays03-ValueRestictsIndex-2.c [2023-11-21 22:25:34,888 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-21 22:25:34,888 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-21 22:25:34,889 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-21 22:25:34,889 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-21 22:25:34,889 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-21 22:25:34,889 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-21 22:25:34,889 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-21 22:25:34,890 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-21 22:25:34,894 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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-21 22:25:34,913 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2023-11-21 22:25:34,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:25:34,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:25:34,919 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-21 22:25:34,919 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-21 22:25:34,919 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-21 22:25:34,920 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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-21 22:25:34,922 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2023-11-21 22:25:34,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:25:34,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:25:34,923 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-21 22:25:34,923 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-21 22:25:34,934 INFO L748 eck$LassoCheckResult]: Stem: 11#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~post1#1, main_~i~0#1, main_#t~mem3#1, main_#t~mem4#1, main_#t~short5#1, main_#t~nondet6#1, main_~x~0#1, main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_#t~nondet0#1;main_~k~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; 3#L15-3true [2023-11-21 22:25:34,934 INFO L750 eck$LassoCheckResult]: Loop: 3#L15-3true assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 7#L15-2true main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 3#L15-3true [2023-11-21 22:25:34,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:25:34,943 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-11-21 22:25:34,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:25:34,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702157348] [2023-11-21 22:25:34,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:25:34,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:25:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:25:35,088 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:25:35,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:25:35,125 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:25:35,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:25:35,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2023-11-21 22:25:35,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:25:35,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670430211] [2023-11-21 22:25:35,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:25:35,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:25:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:25:35,168 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:25:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:25:35,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:25:35,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:25:35,205 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2023-11-21 22:25:35,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:25:35,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901215391] [2023-11-21 22:25:35,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:25:35,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:25:35,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:25:35,254 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:25:35,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:25:35,281 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:25:35,575 INFO L210 LassoAnalysis]: Preferences: [2023-11-21 22:25:35,592 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-21 22:25:35,592 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-21 22:25:35,593 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-21 22:25:35,593 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-21 22:25:35,593 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:25:35,593 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-21 22:25:35,594 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-21 22:25:35,594 INFO L133 ssoRankerPreferences]: Filename of dumped script: Arrays03-ValueRestictsIndex-2.c_Iteration1_Lasso [2023-11-21 22:25:35,594 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-21 22:25:35,595 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-21 22:25:35,639 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-21 22:25:35,832 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-21 22:25:35,836 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-21 22:25:35,841 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-21 22:25:35,846 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-21 22:25:35,851 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-21 22:25:35,855 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-21 22:25:35,860 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-21 22:25:35,864 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-21 22:25:35,898 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-21 22:25:35,903 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-21 22:25:36,120 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-21 22:25:36,126 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-21 22:25:36,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:25:36,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:25:36,132 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:25:36,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-21 22:25:36,142 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-21 22:25:36,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:25:36,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:25:36,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:25:36,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:25:36,176 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:25:36,176 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:25:36,194 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:25:36,228 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-11-21 22:25:36,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:25:36,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:25:36,231 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:25:36,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-21 22:25:36,238 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-21 22:25:36,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:25:36,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:25:36,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:25:36,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:25:36,261 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:25:36,262 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:25:36,277 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:25:36,304 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-11-21 22:25:36,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:25:36,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:25:36,308 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:25:36,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-21 22:25:36,313 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-21 22:25:36,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:25:36,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:25:36,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:25:36,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:25:36,343 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:25:36,344 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:25:36,368 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-21 22:25:36,419 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2023-11-21 22:25:36,419 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2023-11-21 22:25:36,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:25:36,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:25:36,466 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:25:36,474 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-21 22:25:36,489 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-11-21 22:25:36,508 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-21 22:25:36,508 INFO L513 LassoAnalysis]: Proved termination. [2023-11-21 22:25:36,509 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-21 22:25:36,542 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-11-21 22:25:36,553 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-11-21 22:25:36,566 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[~#a~0!base] could not be translated [2023-11-21 22:25:36,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:25:36,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:36,619 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-21 22:25:36,621 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:25:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:36,662 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-21 22:25:36,664 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:25:36,731 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-21 22:25:36,786 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-21 22:25:36,788 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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-21 22:25:36,874 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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 27 states and 41 transitions. Complement of second has 8 states. [2023-11-21 22:25:36,877 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-21 22:25:36,885 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-21 22:25:36,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2023-11-21 22:25:36,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 2 letters. [2023-11-21 22:25:36,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:25:36,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 4 letters. Loop has 2 letters. [2023-11-21 22:25:36,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:25:36,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 4 letters. [2023-11-21 22:25:36,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:25:36,899 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 41 transitions. [2023-11-21 22:25:36,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2023-11-21 22:25:36,912 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 10 states and 13 transitions. [2023-11-21 22:25:36,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2023-11-21 22:25:36,914 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-11-21 22:25:36,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2023-11-21 22:25:36,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:25:36,915 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2023-11-21 22:25:36,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2023-11-21 22:25:36,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2023-11-21 22:25:36,957 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-21 22:25:36,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2023-11-21 22:25:36,959 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2023-11-21 22:25:36,959 INFO L428 stractBuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2023-11-21 22:25:36,960 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-21 22:25:36,960 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2023-11-21 22:25:36,962 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2023-11-21 22:25:36,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:25:36,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:25:36,963 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:25:36,964 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-11-21 22:25:36,964 INFO L748 eck$LassoCheckResult]: Stem: 91#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 92#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~post1#1, main_~i~0#1, main_#t~mem3#1, main_#t~mem4#1, main_#t~short5#1, main_#t~nondet6#1, main_~x~0#1, main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_#t~nondet0#1;main_~k~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; 86#L15-3 assume !(main_~i~0#1 < 1048); 84#L15-4 havoc main_~i~0#1; 85#L19 assume main_~k~0#1 >= 0 && main_~k~0#1 < 1048;call main_#t~mem3#1 := read~int#0(main_~#a~0#1.base, main_~#a~0#1.offset, 4);main_#t~short5#1 := 23 == main_#t~mem3#1; 93#L20 assume !main_#t~short5#1; 89#L20-2 assume main_#t~short5#1;havoc main_#t~mem3#1;havoc main_#t~mem4#1;havoc main_#t~short5#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 90#L22-2 [2023-11-21 22:25:36,965 INFO L750 eck$LassoCheckResult]: Loop: 90#L22-2 assume !!(main_~x~0#1 >= 0);main_~x~0#1 := main_~x~0#1 - main_~k~0#1; 90#L22-2 [2023-11-21 22:25:36,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:25:36,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1807952492, now seen corresponding path program 1 times [2023-11-21 22:25:36,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:25:36,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997304737] [2023-11-21 22:25:36,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:25:36,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:25:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:37,062 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-21 22:25:37,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:25:37,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997304737] [2023-11-21 22:25:37,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997304737] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:25:37,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:25:37,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:25:37,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355887050] [2023-11-21 22:25:37,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:25:37,067 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 22:25:37,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:25:37,068 INFO L85 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 1 times [2023-11-21 22:25:37,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:25:37,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880555960] [2023-11-21 22:25:37,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:25:37,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:25:37,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:25:37,072 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:25:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:25:37,076 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:25:37,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:25:37,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:25:37,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:25:37,096 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-21 22:25:37,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:25:37,112 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2023-11-21 22:25:37,112 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2023-11-21 22:25:37,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2023-11-21 22:25:37,117 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2023-11-21 22:25:37,117 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-11-21 22:25:37,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-11-21 22:25:37,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2023-11-21 22:25:37,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:25:37,118 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2023-11-21 22:25:37,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2023-11-21 22:25:37,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2023-11-21 22:25:37,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 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-21 22:25:37,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2023-11-21 22:25:37,121 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 12 transitions. [2023-11-21 22:25:37,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:25:37,122 INFO L428 stractBuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2023-11-21 22:25:37,123 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-21 22:25:37,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2023-11-21 22:25:37,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2023-11-21 22:25:37,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:25:37,126 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:25:37,126 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:25:37,126 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-11-21 22:25:37,127 INFO L748 eck$LassoCheckResult]: Stem: 118#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 119#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~post1#1, main_~i~0#1, main_#t~mem3#1, main_#t~mem4#1, main_#t~short5#1, main_#t~nondet6#1, main_~x~0#1, main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_#t~nondet0#1;main_~k~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; 113#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 114#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 115#L15-3 assume !(main_~i~0#1 < 1048); 111#L15-4 havoc main_~i~0#1; 112#L19 assume main_~k~0#1 >= 0 && main_~k~0#1 < 1048;call main_#t~mem3#1 := read~int#0(main_~#a~0#1.base, main_~#a~0#1.offset, 4);main_#t~short5#1 := 23 == main_#t~mem3#1; 120#L20 assume !main_#t~short5#1; 116#L20-2 assume main_#t~short5#1;havoc main_#t~mem3#1;havoc main_#t~mem4#1;havoc main_#t~short5#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 117#L22-2 [2023-11-21 22:25:37,127 INFO L750 eck$LassoCheckResult]: Loop: 117#L22-2 assume !!(main_~x~0#1 >= 0);main_~x~0#1 := main_~x~0#1 - main_~k~0#1; 117#L22-2 [2023-11-21 22:25:37,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:25:37,127 INFO L85 PathProgramCache]: Analyzing trace with hash -369324246, now seen corresponding path program 1 times [2023-11-21 22:25:37,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:25:37,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780350302] [2023-11-21 22:25:37,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:25:37,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:25:37,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:37,248 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-21 22:25:37,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:25:37,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780350302] [2023-11-21 22:25:37,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780350302] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:25:37,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566370142] [2023-11-21 22:25:37,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:25:37,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:25:37,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:25:37,252 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:25:37,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-21 22:25:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:37,315 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-21 22:25:37,316 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:25:37,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 22:25:37,329 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:25:37,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566370142] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:25:37,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 22:25:37,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-11-21 22:25:37,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368877389] [2023-11-21 22:25:37,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:25:37,331 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 22:25:37,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:25:37,332 INFO L85 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 2 times [2023-11-21 22:25:37,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:25:37,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300377465] [2023-11-21 22:25:37,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:25:37,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:25:37,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:25:37,342 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:25:37,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:25:37,346 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:25:37,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:25:37,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:25:37,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:25:37,371 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-21 22:25:37,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:25:37,382 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2023-11-21 22:25:37,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2023-11-21 22:25:37,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2023-11-21 22:25:37,385 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 10 states and 11 transitions. [2023-11-21 22:25:37,385 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-11-21 22:25:37,385 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-11-21 22:25:37,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2023-11-21 22:25:37,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:25:37,386 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2023-11-21 22:25:37,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2023-11-21 22:25:37,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2023-11-21 22:25:37,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 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-21 22:25:37,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2023-11-21 22:25:37,391 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2023-11-21 22:25:37,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:25:37,393 INFO L428 stractBuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2023-11-21 22:25:37,394 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-21 22:25:37,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2023-11-21 22:25:37,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2023-11-21 22:25:37,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:25:37,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:25:37,397 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:25:37,397 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-11-21 22:25:37,397 INFO L748 eck$LassoCheckResult]: Stem: 171#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 172#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~post1#1, main_~i~0#1, main_#t~mem3#1, main_#t~mem4#1, main_#t~short5#1, main_#t~nondet6#1, main_~x~0#1, main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_#t~nondet0#1;main_~k~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; 168#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 169#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 170#L15-3 assume !(main_~i~0#1 < 1048); 164#L15-4 havoc main_~i~0#1; 165#L19 assume main_~k~0#1 >= 0 && main_~k~0#1 < 1048;call main_#t~mem3#1 := read~int#0(main_~#a~0#1.base, main_~#a~0#1.offset, 4);main_#t~short5#1 := 23 == main_#t~mem3#1; 173#L20 assume main_#t~short5#1;call main_#t~mem4#1 := read~int#0(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);main_#t~short5#1 := 42 == main_#t~mem4#1; 166#L20-2 assume main_#t~short5#1;havoc main_#t~mem3#1;havoc main_#t~mem4#1;havoc main_#t~short5#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 167#L22-2 [2023-11-21 22:25:37,397 INFO L750 eck$LassoCheckResult]: Loop: 167#L22-2 assume !!(main_~x~0#1 >= 0);main_~x~0#1 := main_~x~0#1 - main_~k~0#1; 167#L22-2 [2023-11-21 22:25:37,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:25:37,398 INFO L85 PathProgramCache]: Analyzing trace with hash -369324308, now seen corresponding path program 1 times [2023-11-21 22:25:37,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:25:37,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333494372] [2023-11-21 22:25:37,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:25:37,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:25:37,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:37,487 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-21 22:25:37,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:25:37,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333494372] [2023-11-21 22:25:37,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333494372] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:25:37,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960214980] [2023-11-21 22:25:37,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:25:37,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:25:37,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:25:37,490 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:25:37,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-21 22:25:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:37,547 INFO L262 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-21 22:25:37,548 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:25:37,561 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-21 22:25:37,561 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:25:37,582 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-21 22:25:37,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960214980] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:25:37,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:25:37,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-21 22:25:37,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669831849] [2023-11-21 22:25:37,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:25:37,584 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 22:25:37,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:25:37,584 INFO L85 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 3 times [2023-11-21 22:25:37,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:25:37,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997581890] [2023-11-21 22:25:37,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:25:37,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:25:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:25:37,588 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:25:37,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:25:37,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:25:37,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:25:37,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 22:25:37,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-21 22:25:37,607 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. cyclomatic complexity: 3 Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:25:37,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:25:37,645 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2023-11-21 22:25:37,645 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 17 transitions. [2023-11-21 22:25:37,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2023-11-21 22:25:37,648 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 17 transitions. [2023-11-21 22:25:37,649 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-11-21 22:25:37,649 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-11-21 22:25:37,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 17 transitions. [2023-11-21 22:25:37,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:25:37,649 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 17 transitions. [2023-11-21 22:25:37,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 17 transitions. [2023-11-21 22:25:37,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-11-21 22:25:37,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.0625) internal successors, (17), 15 states have internal predecessors, (17), 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-21 22:25:37,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2023-11-21 22:25:37,657 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 17 transitions. [2023-11-21 22:25:37,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:25:37,660 INFO L428 stractBuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2023-11-21 22:25:37,660 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-21 22:25:37,660 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 17 transitions. [2023-11-21 22:25:37,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2023-11-21 22:25:37,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:25:37,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:25:37,663 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:25:37,663 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-11-21 22:25:37,664 INFO L748 eck$LassoCheckResult]: Stem: 256#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 257#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~post1#1, main_~i~0#1, main_#t~mem3#1, main_#t~mem4#1, main_#t~short5#1, main_#t~nondet6#1, main_~x~0#1, main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_#t~nondet0#1;main_~k~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; 250#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 251#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 252#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 253#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 263#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 262#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 261#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 260#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 259#L15-3 assume !(main_~i~0#1 < 1048); 248#L15-4 havoc main_~i~0#1; 249#L19 assume main_~k~0#1 >= 0 && main_~k~0#1 < 1048;call main_#t~mem3#1 := read~int#0(main_~#a~0#1.base, main_~#a~0#1.offset, 4);main_#t~short5#1 := 23 == main_#t~mem3#1; 258#L20 assume main_#t~short5#1;call main_#t~mem4#1 := read~int#0(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);main_#t~short5#1 := 42 == main_#t~mem4#1; 254#L20-2 assume main_#t~short5#1;havoc main_#t~mem3#1;havoc main_#t~mem4#1;havoc main_#t~short5#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 255#L22-2 [2023-11-21 22:25:37,664 INFO L750 eck$LassoCheckResult]: Loop: 255#L22-2 assume !!(main_~x~0#1 >= 0);main_~x~0#1 := main_~x~0#1 - main_~k~0#1; 255#L22-2 [2023-11-21 22:25:37,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:25:37,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1716187174, now seen corresponding path program 2 times [2023-11-21 22:25:37,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:25:37,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880821892] [2023-11-21 22:25:37,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:25:37,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:25:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:37,873 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-21 22:25:37,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:25:37,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880821892] [2023-11-21 22:25:37,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880821892] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:25:37,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936671076] [2023-11-21 22:25:37,874 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 22:25:37,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:25:37,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:25:37,883 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:25:37,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-21 22:25:38,004 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 22:25:38,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:25:38,006 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-21 22:25:38,008 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:25:38,011 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-11-21 22:25:38,054 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-21 22:25:38,055 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:25:38,153 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-21 22:25:38,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936671076] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:25:38,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:25:38,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-11-21 22:25:38,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823052469] [2023-11-21 22:25:38,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:25:38,155 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 22:25:38,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:25:38,155 INFO L85 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 4 times [2023-11-21 22:25:38,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:25:38,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438162788] [2023-11-21 22:25:38,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:25:38,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:25:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:25:38,160 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:25:38,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:25:38,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:25:38,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:25:38,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-21 22:25:38,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-21 22:25:38,185 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. cyclomatic complexity: 3 Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:25:38,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:25:38,267 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2023-11-21 22:25:38,267 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 29 transitions. [2023-11-21 22:25:38,269 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2023-11-21 22:25:38,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 29 transitions. [2023-11-21 22:25:38,271 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-11-21 22:25:38,271 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-11-21 22:25:38,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 29 transitions. [2023-11-21 22:25:38,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:25:38,272 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 29 transitions. [2023-11-21 22:25:38,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 29 transitions. [2023-11-21 22:25:38,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-11-21 22:25:38,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 27 states have internal predecessors, (29), 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-21 22:25:38,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2023-11-21 22:25:38,280 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 29 transitions. [2023-11-21 22:25:38,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-21 22:25:38,282 INFO L428 stractBuchiCegarLoop]: Abstraction has 28 states and 29 transitions. [2023-11-21 22:25:38,282 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-21 22:25:38,282 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 29 transitions. [2023-11-21 22:25:38,283 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2023-11-21 22:25:38,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:25:38,283 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:25:38,284 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:25:38,284 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-11-21 22:25:38,285 INFO L748 eck$LassoCheckResult]: Stem: 400#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 401#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~post1#1, main_~i~0#1, main_#t~mem3#1, main_#t~mem4#1, main_#t~short5#1, main_#t~nondet6#1, main_~x~0#1, main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_#t~nondet0#1;main_~k~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; 394#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 395#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 396#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 397#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 403#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 419#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 418#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 417#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 416#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 415#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 414#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 413#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 412#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 411#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 410#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 409#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 408#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 407#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 406#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 405#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 404#L15-3 assume !(main_~i~0#1 < 1048); 392#L15-4 havoc main_~i~0#1; 393#L19 assume main_~k~0#1 >= 0 && main_~k~0#1 < 1048;call main_#t~mem3#1 := read~int#0(main_~#a~0#1.base, main_~#a~0#1.offset, 4);main_#t~short5#1 := 23 == main_#t~mem3#1; 402#L20 assume main_#t~short5#1;call main_#t~mem4#1 := read~int#0(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);main_#t~short5#1 := 42 == main_#t~mem4#1; 398#L20-2 assume main_#t~short5#1;havoc main_#t~mem3#1;havoc main_#t~mem4#1;havoc main_#t~short5#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 399#L22-2 [2023-11-21 22:25:38,285 INFO L750 eck$LassoCheckResult]: Loop: 399#L22-2 assume !!(main_~x~0#1 >= 0);main_~x~0#1 := main_~x~0#1 - main_~k~0#1; 399#L22-2 [2023-11-21 22:25:38,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:25:38,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1328175130, now seen corresponding path program 3 times [2023-11-21 22:25:38,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:25:38,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717197603] [2023-11-21 22:25:38,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:25:38,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:25:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:38,570 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-21 22:25:38,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:25:38,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717197603] [2023-11-21 22:25:38,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717197603] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:25:38,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064803598] [2023-11-21 22:25:38,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-21 22:25:38,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:25:38,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:25:38,580 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:25:38,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-21 22:25:38,772 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-11-21 22:25:38,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:25:38,774 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-21 22:25:38,777 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:25:38,854 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-21 22:25:38,855 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:25:39,173 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-21 22:25:39,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064803598] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:25:39,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:25:39,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2023-11-21 22:25:39,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301556532] [2023-11-21 22:25:39,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:25:39,175 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 22:25:39,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:25:39,175 INFO L85 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 5 times [2023-11-21 22:25:39,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:25:39,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497334507] [2023-11-21 22:25:39,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:25:39,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:25:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:25:39,179 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:25:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:25:39,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:25:39,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:25:39,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-21 22:25:39,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2023-11-21 22:25:39,198 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. cyclomatic complexity: 3 Second operand has 25 states, 25 states have (on average 2.08) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:25:39,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:25:39,317 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2023-11-21 22:25:39,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 53 transitions. [2023-11-21 22:25:39,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2023-11-21 22:25:39,319 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 53 transitions. [2023-11-21 22:25:39,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-11-21 22:25:39,320 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-11-21 22:25:39,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 53 transitions. [2023-11-21 22:25:39,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:25:39,321 INFO L218 hiAutomatonCegarLoop]: Abstraction has 52 states and 53 transitions. [2023-11-21 22:25:39,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 53 transitions. [2023-11-21 22:25:39,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-11-21 22:25:39,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 51 states have internal predecessors, (53), 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-21 22:25:39,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2023-11-21 22:25:39,326 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 53 transitions. [2023-11-21 22:25:39,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-21 22:25:39,327 INFO L428 stractBuchiCegarLoop]: Abstraction has 52 states and 53 transitions. [2023-11-21 22:25:39,327 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-21 22:25:39,327 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 53 transitions. [2023-11-21 22:25:39,329 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2023-11-21 22:25:39,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:25:39,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:25:39,331 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:25:39,331 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-11-21 22:25:39,331 INFO L748 eck$LassoCheckResult]: Stem: 664#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 665#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~post1#1, main_~i~0#1, main_#t~mem3#1, main_#t~mem4#1, main_#t~short5#1, main_#t~nondet6#1, main_~x~0#1, main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_#t~nondet0#1;main_~k~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; 658#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 659#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 660#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 661#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 667#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 707#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 706#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 705#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 704#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 703#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 702#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 701#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 700#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 699#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 698#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 697#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 696#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 695#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 694#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 693#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 692#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 691#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 690#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 689#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 688#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 687#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 686#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 685#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 684#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 683#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 682#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 681#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 680#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 679#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 678#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 677#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 676#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 675#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 674#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 673#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 672#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 671#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 670#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 669#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 668#L15-3 assume !(main_~i~0#1 < 1048); 656#L15-4 havoc main_~i~0#1; 657#L19 assume main_~k~0#1 >= 0 && main_~k~0#1 < 1048;call main_#t~mem3#1 := read~int#0(main_~#a~0#1.base, main_~#a~0#1.offset, 4);main_#t~short5#1 := 23 == main_#t~mem3#1; 666#L20 assume main_#t~short5#1;call main_#t~mem4#1 := read~int#0(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);main_#t~short5#1 := 42 == main_#t~mem4#1; 662#L20-2 assume main_#t~short5#1;havoc main_#t~mem3#1;havoc main_#t~mem4#1;havoc main_#t~short5#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 663#L22-2 [2023-11-21 22:25:39,332 INFO L750 eck$LassoCheckResult]: Loop: 663#L22-2 assume !!(main_~x~0#1 >= 0);main_~x~0#1 := main_~x~0#1 - main_~k~0#1; 663#L22-2 [2023-11-21 22:25:39,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:25:39,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1458388482, now seen corresponding path program 4 times [2023-11-21 22:25:39,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:25:39,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691492183] [2023-11-21 22:25:39,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:25:39,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:25:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:40,211 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-21 22:25:40,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:25:40,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691492183] [2023-11-21 22:25:40,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691492183] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:25:40,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549035694] [2023-11-21 22:25:40,212 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-21 22:25:40,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:25:40,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:25:40,216 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:25:40,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-21 22:25:40,358 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-21 22:25:40,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:25:40,361 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-21 22:25:40,365 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:25:40,502 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-21 22:25:40,502 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:25:41,613 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-21 22:25:41,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549035694] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:25:41,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:25:41,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2023-11-21 22:25:41,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582476348] [2023-11-21 22:25:41,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:25:41,615 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 22:25:41,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:25:41,615 INFO L85 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 6 times [2023-11-21 22:25:41,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:25:41,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893792509] [2023-11-21 22:25:41,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:25:41,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:25:41,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:25:41,621 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:25:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:25:41,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:25:41,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:25:41,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-21 22:25:41,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2023-11-21 22:25:41,645 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. cyclomatic complexity: 3 Second operand has 49 states, 49 states have (on average 2.0408163265306123) internal successors, (100), 49 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:25:41,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:25:41,894 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2023-11-21 22:25:41,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 101 transitions. [2023-11-21 22:25:41,896 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2023-11-21 22:25:41,897 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 100 states and 101 transitions. [2023-11-21 22:25:41,898 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-11-21 22:25:41,898 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-11-21 22:25:41,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 101 transitions. [2023-11-21 22:25:41,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:25:41,899 INFO L218 hiAutomatonCegarLoop]: Abstraction has 100 states and 101 transitions. [2023-11-21 22:25:41,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 101 transitions. [2023-11-21 22:25:41,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-11-21 22:25:41,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 100 states have (on average 1.01) internal successors, (101), 99 states have internal predecessors, (101), 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-21 22:25:41,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2023-11-21 22:25:41,906 INFO L240 hiAutomatonCegarLoop]: Abstraction has 100 states and 101 transitions. [2023-11-21 22:25:41,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-11-21 22:25:41,907 INFO L428 stractBuchiCegarLoop]: Abstraction has 100 states and 101 transitions. [2023-11-21 22:25:41,907 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-21 22:25:41,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 101 transitions. [2023-11-21 22:25:41,909 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2023-11-21 22:25:41,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:25:41,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:25:41,913 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 46, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:25:41,913 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-11-21 22:25:41,913 INFO L748 eck$LassoCheckResult]: Stem: 1168#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1169#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet2#1, main_#t~post1#1, main_~i~0#1, main_#t~mem3#1, main_#t~mem4#1, main_#t~short5#1, main_#t~nondet6#1, main_~x~0#1, main_~k~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_#t~nondet0#1;main_~k~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0; 1162#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1163#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1164#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1165#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1171#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1259#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1258#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1257#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1256#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1255#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1254#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1253#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1252#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1251#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1250#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1249#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1248#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1247#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1246#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1245#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1244#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1243#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1242#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1241#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1240#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1239#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1238#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1237#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1236#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1235#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1234#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1233#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1232#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1231#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1230#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1229#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1228#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1227#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1226#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1225#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1224#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1223#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1222#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1221#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1220#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1219#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1218#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1217#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1216#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1215#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1214#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1213#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1212#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1211#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1210#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1209#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1208#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1207#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1206#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1205#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1204#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1203#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1202#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1201#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1200#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1199#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1198#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1197#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1196#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1195#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1194#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1193#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1192#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1191#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1190#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1189#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1188#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1187#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1186#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1185#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1184#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1183#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1182#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1181#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1180#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1179#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1178#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1177#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1176#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1175#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1174#L15-3 assume !!(main_~i~0#1 < 1048);havoc main_#t~nondet2#1;call write~int#0(main_#t~nondet2#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1173#L15-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1172#L15-3 assume !(main_~i~0#1 < 1048); 1160#L15-4 havoc main_~i~0#1; 1161#L19 assume main_~k~0#1 >= 0 && main_~k~0#1 < 1048;call main_#t~mem3#1 := read~int#0(main_~#a~0#1.base, main_~#a~0#1.offset, 4);main_#t~short5#1 := 23 == main_#t~mem3#1; 1170#L20 assume main_#t~short5#1;call main_#t~mem4#1 := read~int#0(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~k~0#1, 4);main_#t~short5#1 := 42 == main_#t~mem4#1; 1166#L20-2 assume main_#t~short5#1;havoc main_#t~mem3#1;havoc main_#t~mem4#1;havoc main_#t~short5#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 1167#L22-2 [2023-11-21 22:25:41,914 INFO L750 eck$LassoCheckResult]: Loop: 1167#L22-2 assume !!(main_~x~0#1 >= 0);main_~x~0#1 := main_~x~0#1 - main_~k~0#1; 1167#L22-2 [2023-11-21 22:25:41,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:25:41,915 INFO L85 PathProgramCache]: Analyzing trace with hash 546267602, now seen corresponding path program 5 times [2023-11-21 22:25:41,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:25:41,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651089171] [2023-11-21 22:25:41,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:25:41,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:25:42,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:25:44,466 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-21 22:25:44,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:25:44,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651089171] [2023-11-21 22:25:44,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651089171] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:25:44,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143949015] [2023-11-21 22:25:44,467 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-21 22:25:44,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:25:44,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:25:44,472 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:25:44,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6eb8d878-ab51-483d-8d44-60764c4d157b/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process