./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/array17_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/array17_alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya --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 c64c4370fd8b6e918e28e5e9f3a24e52a6875ae7268f4c7e3f97f19ee293047c --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:27:03,434 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:27:03,518 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-11-29 01:27:03,522 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:27:03,523 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:27:03,547 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:27:03,547 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:27:03,548 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:27:03,549 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:27:03,549 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:27:03,550 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:27:03,550 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:27:03,551 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:27:03,551 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-29 01:27:03,552 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-29 01:27:03,552 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-29 01:27:03,553 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-29 01:27:03,553 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-29 01:27:03,554 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-29 01:27:03,554 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:27:03,555 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-29 01:27:03,556 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:27:03,556 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:27:03,556 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-29 01:27:03,557 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-29 01:27:03,557 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-29 01:27:03,558 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 01:27:03,558 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:27:03,558 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-29 01:27:03,559 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:27:03,559 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:27:03,560 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:27:03,560 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:27:03,560 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:27:03,561 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-29 01:27:03,561 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_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/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_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya 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 -> c64c4370fd8b6e918e28e5e9f3a24e52a6875ae7268f4c7e3f97f19ee293047c [2023-11-29 01:27:03,782 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:27:03,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:27:03,816 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:27:03,818 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:27:03,818 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:27:03,820 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/termination-15/array17_alloca.i [2023-11-29 01:27:06,589 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:27:06,789 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:27:06,789 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/sv-benchmarks/c/termination-15/array17_alloca.i [2023-11-29 01:27:06,799 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/data/389befbe4/eb33de46bc084a058d0a7e8436fdba82/FLAG1db55d682 [2023-11-29 01:27:06,813 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/data/389befbe4/eb33de46bc084a058d0a7e8436fdba82 [2023-11-29 01:27:06,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:27:06,816 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:27:06,818 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:27:06,818 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:27:06,822 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:27:06,822 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:27:06" (1/1) ... [2023-11-29 01:27:06,823 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a014312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:06, skipping insertion in model container [2023-11-29 01:27:06,823 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:27:06" (1/1) ... [2023-11-29 01:27:06,859 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:27:07,102 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:27:07,111 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:27:07,148 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:27:07,177 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:27:07,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:07 WrapperNode [2023-11-29 01:27:07,177 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:27:07,178 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:27:07,178 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:27:07,178 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:27:07,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:07" (1/1) ... [2023-11-29 01:27:07,195 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:07" (1/1) ... [2023-11-29 01:27:07,213 INFO L138 Inliner]: procedures = 151, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 65 [2023-11-29 01:27:07,214 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:27:07,214 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:27:07,215 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:27:07,215 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:27:07,223 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:07" (1/1) ... [2023-11-29 01:27:07,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:07" (1/1) ... [2023-11-29 01:27:07,225 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:07" (1/1) ... [2023-11-29 01:27:07,238 INFO L175 MemorySlicer]: Split 3 memory accesses to 1 slices as follows [3]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 1 writes are split as follows [1]. [2023-11-29 01:27:07,239 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:07" (1/1) ... [2023-11-29 01:27:07,239 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:07" (1/1) ... [2023-11-29 01:27:07,244 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:07" (1/1) ... [2023-11-29 01:27:07,247 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:07" (1/1) ... [2023-11-29 01:27:07,248 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:07" (1/1) ... [2023-11-29 01:27:07,249 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:07" (1/1) ... [2023-11-29 01:27:07,251 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:27:07,252 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:27:07,252 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:27:07,252 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:27:07,253 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:07" (1/1) ... [2023-11-29 01:27:07,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:27:07,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:27:07,280 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:27:07,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-29 01:27:07,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 01:27:07,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 01:27:07,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 01:27:07,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 01:27:07,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:27:07,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:27:07,380 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:27:07,382 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:27:07,554 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:27:07,563 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:27:07,563 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 01:27:07,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:27:07 BoogieIcfgContainer [2023-11-29 01:27:07,565 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:27:07,566 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-29 01:27:07,566 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-29 01:27:07,571 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-29 01:27:07,572 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 01:27:07,572 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 01:27:06" (1/3) ... [2023-11-29 01:27:07,573 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b3206f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 01:27:07, skipping insertion in model container [2023-11-29 01:27:07,573 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 01:27:07,574 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:07" (2/3) ... [2023-11-29 01:27:07,574 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b3206f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 01:27:07, skipping insertion in model container [2023-11-29 01:27:07,574 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 01:27:07,574 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:27:07" (3/3) ... [2023-11-29 01:27:07,576 INFO L332 chiAutomizerObserver]: Analyzing ICFG array17_alloca.i [2023-11-29 01:27:07,621 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-29 01:27:07,621 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-29 01:27:07,621 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-29 01:27:07,621 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-29 01:27:07,621 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-29 01:27:07,622 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-29 01:27:07,622 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-29 01:27:07,622 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-29 01:27:07,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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-29 01:27:07,640 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-11-29 01:27:07,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:27:07,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:27:07,645 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-11-29 01:27:07,645 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 01:27:07,645 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-29 01:27:07,645 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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-29 01:27:07,647 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-11-29 01:27:07,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:27:07,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:27:07,648 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-11-29 01:27:07,648 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 01:27:07,654 INFO L748 eck$LassoCheckResult]: Stem: 12#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 13#L367true assume !(main_~length~0#1 < 1); 10#L367-2true assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 14#L371true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 16#L373true assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 3#L375-3true [2023-11-29 01:27:07,655 INFO L750 eck$LassoCheckResult]: Loop: 3#L375-3true assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 8#L375-2true main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 3#L375-3true [2023-11-29 01:27:07,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:07,659 INFO L85 PathProgramCache]: Analyzing trace with hash 889572334, now seen corresponding path program 1 times [2023-11-29 01:27:07,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:27:07,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583418262] [2023-11-29 01:27:07,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:07,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:27:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:27:07,755 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:27:07,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:27:07,783 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:27:07,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:07,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2023-11-29 01:27:07,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:27:07,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153714022] [2023-11-29 01:27:07,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:07,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:27:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:27:07,798 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:27:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:27:07,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:27:07,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:07,811 INFO L85 PathProgramCache]: Analyzing trace with hash 180522064, now seen corresponding path program 1 times [2023-11-29 01:27:07,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:27:07,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715839192] [2023-11-29 01:27:07,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:07,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:27:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:27:07,838 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:27:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:27:07,863 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:27:08,149 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 01:27:08,150 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 01:27:08,150 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 01:27:08,150 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 01:27:08,150 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 01:27:08,150 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:27:08,151 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 01:27:08,151 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 01:27:08,151 INFO L133 ssoRankerPreferences]: Filename of dumped script: array17_alloca.i_Iteration1_Lasso [2023-11-29 01:27:08,151 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 01:27:08,151 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 01:27:08,166 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-29 01:27:08,174 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-29 01:27:08,177 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-29 01:27:08,183 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-29 01:27:08,185 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-29 01:27:08,190 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-29 01:27:08,192 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-29 01:27:08,195 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-29 01:27:08,199 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-29 01:27:08,201 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-29 01:27:08,205 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-29 01:27:08,207 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-29 01:27:08,671 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 01:27:08,676 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 01:27:08,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:27:08,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:27:08,678 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:27:08,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-29 01:27:08,682 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-29 01:27:08,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:27:08,693 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:27:08,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:27:08,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:27:08,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:27:08,695 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:27:08,696 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:27:08,697 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:27:08,707 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-11-29 01:27:08,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:27:08,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:27:08,709 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:27:08,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-29 01:27:08,713 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:27:08,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:27:08,726 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:27:08,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:27:08,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:27:08,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:27:08,727 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:27:08,727 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:27:08,729 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:27:08,733 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-11-29 01:27:08,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:27:08,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:27:08,734 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:27:08,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-29 01:27:08,742 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-29 01:27:08,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:27:08,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:27:08,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:27:08,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:27:08,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:27:08,754 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:27:08,754 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:27:08,759 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:27:08,762 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-11-29 01:27:08,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:27:08,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:27:08,763 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:27:08,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-11-29 01:27:08,766 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-29 01:27:08,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:27:08,777 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:27:08,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:27:08,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:27:08,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:27:08,778 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:27:08,778 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:27:08,780 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:27:08,782 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2023-11-29 01:27:08,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:27:08,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:27:08,784 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:27:08,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-11-29 01:27:08,793 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-29 01:27:08,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:27:08,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:27:08,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:27:08,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:27:08,824 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 01:27:08,824 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 01:27:08,834 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:27:08,837 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-11-29 01:27:08,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:27:08,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:27:08,839 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:27:08,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-11-29 01:27:08,842 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:27:08,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:27:08,854 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:27:08,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:27:08,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:27:08,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:27:08,855 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:27:08,855 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:27:08,857 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:27:08,860 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2023-11-29 01:27:08,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:27:08,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:27:08,862 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:27:08,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-11-29 01:27:08,865 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-29 01:27:08,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:27:08,877 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:27:08,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:27:08,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:27:08,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:27:08,878 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:27:08,879 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:27:08,880 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:27:08,884 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2023-11-29 01:27:08,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:27:08,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:27:08,885 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:27:08,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-11-29 01:27:08,888 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-29 01:27:08,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:27:08,900 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:27:08,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:27:08,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:27:08,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:27:08,901 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:27:08,902 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:27:08,903 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:27:08,907 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2023-11-29 01:27:08,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:27:08,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:27:08,908 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:27:08,910 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-11-29 01:27:08,911 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-29 01:27:08,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:27:08,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:27:08,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:27:08,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:27:08,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:27:08,925 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:27:08,925 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:27:08,927 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:27:08,930 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2023-11-29 01:27:08,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:27:08,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:27:08,932 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:27:08,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-11-29 01:27:08,936 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-29 01:27:08,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:27:08,947 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:27:08,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:27:08,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:27:08,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:27:08,948 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:27:08,948 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:27:08,950 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:27:08,953 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2023-11-29 01:27:08,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:27:08,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:27:08,955 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:27:08,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-11-29 01:27:08,959 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-29 01:27:08,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:27:08,971 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:27:08,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:27:08,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:27:08,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:27:08,972 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:27:08,972 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:27:08,973 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:27:08,976 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2023-11-29 01:27:08,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:27:08,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:27:08,978 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:27:08,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-11-29 01:27:08,980 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-29 01:27:08,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:27:08,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:27:08,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:27:08,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:27:09,000 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 01:27:09,001 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 01:27:09,020 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 01:27:09,058 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2023-11-29 01:27:09,058 INFO L444 ModelExtractionUtils]: 11 out of 19 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-11-29 01:27:09,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:27:09,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:27:09,088 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:27:09,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-11-29 01:27:09,090 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 01:27:09,101 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-29 01:27:09,101 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 01:27:09,101 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length~0#1, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~length~0#1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2023-11-29 01:27:09,104 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-11-29 01:27:09,115 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2023-11-29 01:27:09,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:09,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:27:09,158 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 01:27:09,159 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:27:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:27:09,183 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:27:09,184 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:27:09,200 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-29 01:27:09,228 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-29 01:27:09,229 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:27:09,278 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 32 states and 47 transitions. Complement of second has 8 states. [2023-11-29 01:27:09,280 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-29 01:27:09,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:27:09,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2023-11-29 01:27:09,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 6 letters. Loop has 2 letters. [2023-11-29 01:27:09,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:27:09,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 8 letters. Loop has 2 letters. [2023-11-29 01:27:09,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:27:09,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 6 letters. Loop has 4 letters. [2023-11-29 01:27:09,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:27:09,289 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 47 transitions. [2023-11-29 01:27:09,292 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 01:27:09,295 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 12 states and 16 transitions. [2023-11-29 01:27:09,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2023-11-29 01:27:09,297 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2023-11-29 01:27:09,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2023-11-29 01:27:09,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:27:09,298 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2023-11-29 01:27:09,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2023-11-29 01:27:09,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2023-11-29 01:27:09,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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-29 01:27:09,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2023-11-29 01:27:09,323 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2023-11-29 01:27:09,323 INFO L428 stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2023-11-29 01:27:09,323 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-29 01:27:09,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2023-11-29 01:27:09,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 01:27:09,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:27:09,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:27:09,324 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:27:09,324 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 01:27:09,325 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~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 120#L367 assume !(main_~length~0#1 < 1); 112#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 113#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 121#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 114#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 115#L375-4 main_~j~0#1 := 1; 110#L380-2 [2023-11-29 01:27:09,325 INFO L750 eck$LassoCheckResult]: Loop: 110#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 111#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 110#L380-2 [2023-11-29 01:27:09,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:09,325 INFO L85 PathProgramCache]: Analyzing trace with hash 180522006, now seen corresponding path program 1 times [2023-11-29 01:27:09,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:27:09,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143427884] [2023-11-29 01:27:09,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:09,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:27:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:27:09,407 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-29 01:27:09,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:27:09,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143427884] [2023-11-29 01:27:09,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143427884] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:27:09,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:27:09,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:27:09,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590655542] [2023-11-29 01:27:09,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:27:09,411 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 01:27:09,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:09,412 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 1 times [2023-11-29 01:27:09,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:27:09,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422023627] [2023-11-29 01:27:09,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:09,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:27:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:27:09,418 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:27:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:27:09,424 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:27:09,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:27:09,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:27:09,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:27:09,508 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:27:09,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:27:09,534 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2023-11-29 01:27:09,534 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2023-11-29 01:27:09,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 01:27:09,535 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 16 transitions. [2023-11-29 01:27:09,535 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2023-11-29 01:27:09,536 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2023-11-29 01:27:09,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2023-11-29 01:27:09,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:27:09,536 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2023-11-29 01:27:09,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2023-11-29 01:27:09,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2023-11-29 01:27:09,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:27:09,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2023-11-29 01:27:09,538 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 15 transitions. [2023-11-29 01:27:09,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:27:09,539 INFO L428 stractBuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2023-11-29 01:27:09,539 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-29 01:27:09,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2023-11-29 01:27:09,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 01:27:09,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:27:09,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:27:09,541 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:27:09,541 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 01:27:09,541 INFO L748 eck$LassoCheckResult]: Stem: 150#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 151#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 152#L367 assume !(main_~length~0#1 < 1); 144#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 145#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 153#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 146#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 147#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 148#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 149#L375-4 main_~j~0#1 := 1; 142#L380-2 [2023-11-29 01:27:09,541 INFO L750 eck$LassoCheckResult]: Loop: 142#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 143#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 142#L380-2 [2023-11-29 01:27:09,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:09,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1683012600, now seen corresponding path program 1 times [2023-11-29 01:27:09,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:27:09,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238050559] [2023-11-29 01:27:09,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:09,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:27:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:27:09,557 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:27:09,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:27:09,571 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:27:09,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:09,571 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 2 times [2023-11-29 01:27:09,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:27:09,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533385957] [2023-11-29 01:27:09,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:09,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:27:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:27:09,578 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:27:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:27:09,584 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:27:09,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:09,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1827560517, now seen corresponding path program 1 times [2023-11-29 01:27:09,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:27:09,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857467943] [2023-11-29 01:27:09,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:09,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:27:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:27:09,682 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-29 01:27:09,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:27:09,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857467943] [2023-11-29 01:27:09,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857467943] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:27:09,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726656181] [2023-11-29 01:27:09,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:09,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:27:09,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:27:09,685 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:27:09,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-29 01:27:09,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:27:09,744 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 01:27:09,745 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:27:09,774 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-29 01:27:09,774 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:27:09,804 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-29 01:27:09,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726656181] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:27:09,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:27:09,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2023-11-29 01:27:09,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374471954] [2023-11-29 01:27:09,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:27:09,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:27:09,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:27:09,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:27:09,888 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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-29 01:27:09,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:27:09,965 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2023-11-29 01:27:09,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2023-11-29 01:27:09,966 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 01:27:09,967 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 15 states and 17 transitions. [2023-11-29 01:27:09,967 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2023-11-29 01:27:09,967 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2023-11-29 01:27:09,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2023-11-29 01:27:09,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:27:09,967 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 17 transitions. [2023-11-29 01:27:09,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2023-11-29 01:27:09,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2023-11-29 01:27:09,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 13 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-29 01:27:09,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2023-11-29 01:27:09,969 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2023-11-29 01:27:09,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 01:27:09,970 INFO L428 stractBuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2023-11-29 01:27:09,971 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-29 01:27:09,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2023-11-29 01:27:09,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 01:27:09,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:27:09,972 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:27:09,972 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:27:09,972 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 01:27:09,972 INFO L748 eck$LassoCheckResult]: Stem: 272#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 273#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 274#L367 assume !(main_~length~0#1 < 1); 270#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 271#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 275#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 266#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 267#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 268#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 269#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 277#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 276#L375-4 main_~j~0#1 := 1; 264#L380-2 [2023-11-29 01:27:09,973 INFO L750 eck$LassoCheckResult]: Loop: 264#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 265#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 264#L380-2 [2023-11-29 01:27:09,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:09,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1827505318, now seen corresponding path program 2 times [2023-11-29 01:27:09,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:27:09,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957359597] [2023-11-29 01:27:09,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:09,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:27:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:27:09,988 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:27:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:27:10,016 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2023-11-29 01:27:10,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:27:10,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:10,017 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 3 times [2023-11-29 01:27:10,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:27:10,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314726265] [2023-11-29 01:27:10,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:10,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:27:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:27:10,023 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:27:10,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:27:10,028 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:27:10,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:10,029 INFO L85 PathProgramCache]: Analyzing trace with hash 409014941, now seen corresponding path program 2 times [2023-11-29 01:27:10,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:27:10,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292094235] [2023-11-29 01:27:10,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:10,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:27:10,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:27:10,052 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:27:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:27:10,070 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:27:10,397 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 01:27:10,397 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 01:27:10,397 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 01:27:10,397 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 01:27:10,397 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 01:27:10,398 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:27:10,398 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 01:27:10,398 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 01:27:10,398 INFO L133 ssoRankerPreferences]: Filename of dumped script: array17_alloca.i_Iteration4_Lasso [2023-11-29 01:27:10,398 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 01:27:10,398 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 01:27:10,401 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-29 01:27:10,403 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-29 01:27:10,406 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-29 01:27:10,408 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-29 01:27:10,410 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-29 01:27:10,413 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-29 01:27:10,415 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-29 01:27:10,417 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-29 01:27:10,420 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-29 01:27:10,422 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-29 01:27:10,621 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-29 01:27:10,623 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-29 01:27:10,827 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 01:27:10,827 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 01:27:10,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:27:10,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:27:10,828 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:27:10,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-11-29 01:27:10,847 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-29 01:27:10,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:27:10,857 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:27:10,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:27:10,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:27:10,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:27:10,858 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:27:10,858 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:27:10,860 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:27:10,863 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2023-11-29 01:27:10,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:27:10,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:27:10,864 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:27:10,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-11-29 01:27:10,866 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-29 01:27:10,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:27:10,877 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:27:10,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:27:10,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:27:10,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:27:10,878 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:27:10,878 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:27:10,879 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:27:10,882 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2023-11-29 01:27:10,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:27:10,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:27:10,884 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:27:10,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-11-29 01:27:10,886 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-29 01:27:10,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:27:10,896 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:27:10,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:27:10,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:27:10,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:27:10,897 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:27:10,897 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:27:10,898 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:27:10,902 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2023-11-29 01:27:10,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:27:10,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:27:10,903 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:27:10,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-11-29 01:27:10,905 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-29 01:27:10,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:27:10,915 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:27:10,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:27:10,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:27:10,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:27:10,916 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:27:10,916 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:27:10,917 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:27:10,921 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2023-11-29 01:27:10,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:27:10,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:27:10,922 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:27:10,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-11-29 01:27:10,924 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-29 01:27:10,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:27:10,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:27:10,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:27:10,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:27:10,936 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 01:27:10,936 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 01:27:10,940 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:27:10,944 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2023-11-29 01:27:10,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:27:10,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:27:10,948 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:27:10,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-11-29 01:27:10,955 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-29 01:27:10,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:27:10,968 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:27:10,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:27:10,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:27:10,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:27:10,968 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:27:10,968 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:27:10,970 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:27:10,973 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2023-11-29 01:27:10,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:27:10,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:27:10,974 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:27:10,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-11-29 01:27:10,977 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-29 01:27:10,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:27:10,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:27:10,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:27:10,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:27:10,989 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 01:27:10,989 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 01:27:10,993 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:27:10,998 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2023-11-29 01:27:10,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:27:10,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:27:11,000 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:27:11,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-11-29 01:27:11,003 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-29 01:27:11,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:27:11,014 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:27:11,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:27:11,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:27:11,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:27:11,014 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:27:11,014 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:27:11,016 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:27:11,018 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2023-11-29 01:27:11,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:27:11,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:27:11,020 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:27:11,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-11-29 01:27:11,022 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-29 01:27:11,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:27:11,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:27:11,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:27:11,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:27:11,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:27:11,033 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:27:11,033 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:27:11,034 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:27:11,036 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-11-29 01:27:11,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:27:11,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:27:11,038 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:27:11,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-11-29 01:27:11,040 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-29 01:27:11,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:27:11,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:27:11,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:27:11,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:27:11,056 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 01:27:11,056 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 01:27:11,066 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:27:11,070 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2023-11-29 01:27:11,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:27:11,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:27:11,071 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:27:11,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-11-29 01:27:11,074 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:27:11,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:27:11,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:27:11,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:27:11,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:27:11,089 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 01:27:11,090 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 01:27:11,096 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:27:11,099 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2023-11-29 01:27:11,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:27:11,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:27:11,101 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:27:11,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-11-29 01:27:11,104 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-29 01:27:11,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:27:11,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:27:11,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:27:11,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:27:11,120 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 01:27:11,120 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 01:27:11,145 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 01:27:11,176 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2023-11-29 01:27:11,176 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 10 variables to zero. [2023-11-29 01:27:11,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:27:11,176 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:27:11,179 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:27:11,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-11-29 01:27:11,184 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 01:27:11,194 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-29 01:27:11,194 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 01:27:11,195 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_~arr~0#1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc206#1.base)_2) = -4*ULTIMATE.start_main_~j~0#1 - 1*ULTIMATE.start_main_~arr~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc206#1.base)_2 Supporting invariants [] [2023-11-29 01:27:11,197 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2023-11-29 01:27:11,210 INFO L156 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2023-11-29 01:27:11,212 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[#t~malloc206!base] could not be translated [2023-11-29 01:27:11,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:27:11,252 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:27:11,253 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:27:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:27:11,296 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 01:27:11,296 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:27:11,319 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-29 01:27:11,320 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2023-11-29 01:27:11,320 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-29 01:27:11,363 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 4. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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) Result 18 states and 22 transitions. Complement of second has 6 states. [2023-11-29 01:27:11,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2023-11-29 01:27:11,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-29 01:27:11,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2023-11-29 01:27:11,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 12 letters. Loop has 2 letters. [2023-11-29 01:27:11,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:27:11,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 2 letters. [2023-11-29 01:27:11,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:27:11,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 12 letters. Loop has 4 letters. [2023-11-29 01:27:11,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:27:11,365 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 22 transitions. [2023-11-29 01:27:11,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 01:27:11,367 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 22 transitions. [2023-11-29 01:27:11,367 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2023-11-29 01:27:11,367 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2023-11-29 01:27:11,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2023-11-29 01:27:11,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:27:11,367 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-11-29 01:27:11,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2023-11-29 01:27:11,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-11-29 01:27:11,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:27:11,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2023-11-29 01:27:11,369 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-11-29 01:27:11,369 INFO L428 stractBuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-11-29 01:27:11,370 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-29 01:27:11,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 22 transitions. [2023-11-29 01:27:11,370 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 01:27:11,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:27:11,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:27:11,371 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:27:11,371 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 01:27:11,371 INFO L748 eck$LassoCheckResult]: Stem: 396#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 397#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 398#L367 assume !(main_~length~0#1 < 1); 390#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 391#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 399#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 392#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 393#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 394#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 395#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 402#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 400#L375-4 main_~j~0#1 := 1; 401#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 389#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 385#L380-2 [2023-11-29 01:27:11,371 INFO L750 eck$LassoCheckResult]: Loop: 385#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 386#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 385#L380-2 [2023-11-29 01:27:11,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:11,372 INFO L85 PathProgramCache]: Analyzing trace with hash 409014943, now seen corresponding path program 1 times [2023-11-29 01:27:11,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:27:11,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345954187] [2023-11-29 01:27:11,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:11,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:27:11,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:27:11,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:27:11,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:27:11,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345954187] [2023-11-29 01:27:11,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345954187] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:27:11,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142611073] [2023-11-29 01:27:11,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:11,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:27:11,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:27:11,731 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:27:11,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-11-29 01:27:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:27:11,784 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-29 01:27:11,786 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:27:11,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:27:11,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2023-11-29 01:27:11,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:27:11,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2023-11-29 01:27:11,905 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:27:11,905 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:27:12,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2023-11-29 01:27:12,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:27:12,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 726 treesize of output 630 [2023-11-29 01:27:12,088 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2023-11-29 01:27:12,118 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:27:12,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142611073] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:27:12,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:27:12,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 16 [2023-11-29 01:27:12,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110489839] [2023-11-29 01:27:12,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:27:12,119 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 01:27:12,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:12,119 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 4 times [2023-11-29 01:27:12,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:27:12,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525437373] [2023-11-29 01:27:12,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:12,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:27:12,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:27:12,124 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:27:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:27:12,128 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:27:12,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:27:12,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 01:27:12,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2023-11-29 01:27:12,202 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. cyclomatic complexity: 7 Second operand has 17 states, 16 states have (on average 1.8125) internal successors, (29), 17 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-29 01:27:12,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:27:12,627 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2023-11-29 01:27:12,627 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 37 transitions. [2023-11-29 01:27:12,628 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-11-29 01:27:12,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 29 states and 35 transitions. [2023-11-29 01:27:12,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2023-11-29 01:27:12,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2023-11-29 01:27:12,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2023-11-29 01:27:12,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:27:12,629 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-11-29 01:27:12,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2023-11-29 01:27:12,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2023-11-29 01:27:12,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:27:12,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2023-11-29 01:27:12,632 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 21 transitions. [2023-11-29 01:27:12,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 01:27:12,633 INFO L428 stractBuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2023-11-29 01:27:12,633 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-29 01:27:12,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2023-11-29 01:27:12,634 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 01:27:12,634 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:27:12,634 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:27:12,635 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:27:12,635 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 01:27:12,635 INFO L748 eck$LassoCheckResult]: Stem: 557#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 558#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 559#L367 assume !(main_~length~0#1 < 1); 554#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 555#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 560#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 550#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 551#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 552#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 553#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 562#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 561#L375-4 main_~j~0#1 := 1; 546#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 547#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 548#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 549#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 556#L380-2 [2023-11-29 01:27:12,635 INFO L750 eck$LassoCheckResult]: Loop: 556#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 563#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 556#L380-2 [2023-11-29 01:27:12,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:12,636 INFO L85 PathProgramCache]: Analyzing trace with hash -2073631454, now seen corresponding path program 1 times [2023-11-29 01:27:12,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:27:12,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711666621] [2023-11-29 01:27:12,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:12,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:27:12,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:27:12,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:27:12,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:27:12,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711666621] [2023-11-29 01:27:12,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711666621] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:27:12,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849154158] [2023-11-29 01:27:12,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:12,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:27:12,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:27:12,726 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:27:12,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-11-29 01:27:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:27:12,788 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 01:27:12,789 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:27:12,836 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:27:12,836 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:27:12,878 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:27:12,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849154158] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:27:12,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:27:12,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2023-11-29 01:27:12,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935893169] [2023-11-29 01:27:12,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:27:12,879 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 01:27:12,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:12,879 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 5 times [2023-11-29 01:27:12,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:27:12,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348195224] [2023-11-29 01:27:12,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:12,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:27:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:27:12,884 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:27:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:27:12,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:27:12,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:27:12,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 01:27:12,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-11-29 01:27:12,957 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. cyclomatic complexity: 6 Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:27:13,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:27:13,023 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2023-11-29 01:27:13,024 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 28 transitions. [2023-11-29 01:27:13,024 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 01:27:13,025 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 21 states and 24 transitions. [2023-11-29 01:27:13,025 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2023-11-29 01:27:13,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2023-11-29 01:27:13,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 24 transitions. [2023-11-29 01:27:13,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:27:13,026 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 24 transitions. [2023-11-29 01:27:13,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 24 transitions. [2023-11-29 01:27:13,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2023-11-29 01:27:13,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 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-29 01:27:13,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2023-11-29 01:27:13,028 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 23 transitions. [2023-11-29 01:27:13,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 01:27:13,029 INFO L428 stractBuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2023-11-29 01:27:13,029 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-29 01:27:13,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2023-11-29 01:27:13,030 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 01:27:13,030 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:27:13,030 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:27:13,031 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:27:13,031 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 01:27:13,031 INFO L748 eck$LassoCheckResult]: Stem: 712#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 713#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 714#L367 assume !(main_~length~0#1 < 1); 705#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 706#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 711#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 707#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 708#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 709#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 710#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 717#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 719#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 718#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 715#L375-4 main_~j~0#1 := 1; 716#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 703#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 702#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 704#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 700#L380-2 [2023-11-29 01:27:13,031 INFO L750 eck$LassoCheckResult]: Loop: 700#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 701#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 700#L380-2 [2023-11-29 01:27:13,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:13,031 INFO L85 PathProgramCache]: Analyzing trace with hash -457174268, now seen corresponding path program 2 times [2023-11-29 01:27:13,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:27:13,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120485561] [2023-11-29 01:27:13,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:13,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:27:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:27:13,384 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:27:13,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:27:13,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120485561] [2023-11-29 01:27:13,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120485561] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:27:13,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324733533] [2023-11-29 01:27:13,385 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:27:13,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:27:13,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:27:13,388 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:27:13,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-11-29 01:27:13,452 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:27:13,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:27:13,453 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-29 01:27:13,455 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:27:13,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:27:13,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2023-11-29 01:27:13,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:27:13,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2023-11-29 01:27:13,711 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:27:13,711 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:27:13,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2023-11-29 01:27:13,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:27:13,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 152 [2023-11-29 01:27:13,960 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:27:13,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324733533] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:27:13,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:27:13,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 23 [2023-11-29 01:27:13,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384728696] [2023-11-29 01:27:13,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:27:13,961 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 01:27:13,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:13,962 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 6 times [2023-11-29 01:27:13,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:27:13,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888575004] [2023-11-29 01:27:13,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:13,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:27:13,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:27:13,966 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:27:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:27:13,968 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:27:14,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:27:14,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-29 01:27:14,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2023-11-29 01:27:14,036 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 6 Second operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 24 states have internal predecessors, (39), 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-29 01:27:14,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:27:14,660 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2023-11-29 01:27:14,660 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 71 transitions. [2023-11-29 01:27:14,661 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2023-11-29 01:27:14,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 56 states and 68 transitions. [2023-11-29 01:27:14,662 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2023-11-29 01:27:14,662 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2023-11-29 01:27:14,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 68 transitions. [2023-11-29 01:27:14,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:27:14,663 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56 states and 68 transitions. [2023-11-29 01:27:14,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 68 transitions. [2023-11-29 01:27:14,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 30. [2023-11-29 01:27:14,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 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-29 01:27:14,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2023-11-29 01:27:14,667 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 36 transitions. [2023-11-29 01:27:14,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 01:27:14,669 INFO L428 stractBuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2023-11-29 01:27:14,669 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-29 01:27:14,669 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 36 transitions. [2023-11-29 01:27:14,670 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 01:27:14,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:27:14,670 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:27:14,670 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:27:14,670 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 01:27:14,671 INFO L748 eck$LassoCheckResult]: Stem: 940#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 941#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 942#L367 assume !(main_~length~0#1 < 1); 935#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 936#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 943#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 931#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 932#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 948#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 949#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 933#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 934#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 946#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 944#L375-4 main_~j~0#1 := 1; 945#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 951#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 930#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 929#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 939#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 937#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 938#L380-2 [2023-11-29 01:27:14,671 INFO L750 eck$LassoCheckResult]: Loop: 938#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 950#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 938#L380-2 [2023-11-29 01:27:14,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:14,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1257807801, now seen corresponding path program 3 times [2023-11-29 01:27:14,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:27:14,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534023403] [2023-11-29 01:27:14,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:14,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:27:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:27:14,772 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:27:14,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:27:14,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534023403] [2023-11-29 01:27:14,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534023403] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:27:14,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171704600] [2023-11-29 01:27:14,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 01:27:14,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:27:14,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:27:14,775 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:27:14,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-11-29 01:27:14,839 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-29 01:27:14,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:27:14,840 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 01:27:14,842 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:27:14,910 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:27:14,911 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:27:14,968 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:27:14,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171704600] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:27:14,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:27:14,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 14 [2023-11-29 01:27:14,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557938112] [2023-11-29 01:27:14,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:27:14,969 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 01:27:14,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:14,970 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 7 times [2023-11-29 01:27:14,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:27:14,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893056710] [2023-11-29 01:27:14,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:14,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:27:14,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:27:14,974 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:27:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:27:14,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:27:15,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:27:15,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 01:27:15,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-11-29 01:27:15,050 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. cyclomatic complexity: 9 Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 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-29 01:27:15,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:27:15,146 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2023-11-29 01:27:15,146 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 41 transitions. [2023-11-29 01:27:15,147 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 01:27:15,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 30 states and 35 transitions. [2023-11-29 01:27:15,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2023-11-29 01:27:15,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2023-11-29 01:27:15,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 35 transitions. [2023-11-29 01:27:15,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:27:15,148 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 35 transitions. [2023-11-29 01:27:15,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 35 transitions. [2023-11-29 01:27:15,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-29 01:27:15,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:27:15,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2023-11-29 01:27:15,151 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 35 transitions. [2023-11-29 01:27:15,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 01:27:15,152 INFO L428 stractBuchiCegarLoop]: Abstraction has 30 states and 35 transitions. [2023-11-29 01:27:15,152 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-29 01:27:15,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 35 transitions. [2023-11-29 01:27:15,153 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 01:27:15,153 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:27:15,153 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:27:15,153 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:27:15,154 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 01:27:15,154 INFO L748 eck$LassoCheckResult]: Stem: 1145#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1146#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1147#L367 assume !(main_~length~0#1 < 1); 1137#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1138#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 1148#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 1139#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1140#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1141#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1142#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1151#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1162#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1161#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1160#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1154#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 1155#L375-4 main_~j~0#1 := 1; 1152#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1153#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1135#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1136#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1144#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1143#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 1133#L380-2 [2023-11-29 01:27:15,154 INFO L750 eck$LassoCheckResult]: Loop: 1133#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1134#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1133#L380-2 [2023-11-29 01:27:15,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:15,154 INFO L85 PathProgramCache]: Analyzing trace with hash -948777687, now seen corresponding path program 4 times [2023-11-29 01:27:15,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:27:15,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527097598] [2023-11-29 01:27:15,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:15,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:27:15,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:27:15,561 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:27:15,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:27:15,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527097598] [2023-11-29 01:27:15,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527097598] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:27:15,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164724931] [2023-11-29 01:27:15,562 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 01:27:15,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:27:15,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:27:15,565 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:27:15,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-11-29 01:27:15,638 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 01:27:15,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:27:15,640 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-29 01:27:15,642 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:27:15,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-29 01:27:15,771 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2023-11-29 01:27:15,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2023-11-29 01:27:16,252 INFO L349 Elim1Store]: treesize reduction 38, result has 15.6 percent of original size [2023-11-29 01:27:16,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 36 [2023-11-29 01:27:16,259 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:27:16,259 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:27:46,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2023-11-29 01:27:46,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:27:46,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 494 treesize of output 390 [2023-11-29 01:27:46,202 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:27:46,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164724931] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:27:46,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:27:46,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 31 [2023-11-29 01:27:46,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272254809] [2023-11-29 01:27:46,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:27:46,203 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 01:27:46,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:46,204 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 8 times [2023-11-29 01:27:46,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:27:46,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244686584] [2023-11-29 01:27:46,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:46,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:27:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:27:46,207 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:27:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:27:46,210 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:27:46,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:27:46,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-29 01:27:46,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=827, Unknown=3, NotChecked=0, Total=992 [2023-11-29 01:27:46,282 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. cyclomatic complexity: 8 Second operand has 32 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 32 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:27:59,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 11.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 01:28:17,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:28:35,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 01:28:59,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 12.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 01:29:05,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 01:29:39,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 12.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 01:29:51,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 12.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 01:29:57,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 01:30:32,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 01:30:41,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 6.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 01:30:43,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:30:54,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 10.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 01:30:54,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:30:54,543 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2023-11-29 01:30:54,543 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 72 transitions. [2023-11-29 01:30:54,544 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2023-11-29 01:30:54,544 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 41 states and 47 transitions. [2023-11-29 01:30:54,545 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2023-11-29 01:30:54,545 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2023-11-29 01:30:54,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 47 transitions. [2023-11-29 01:30:54,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:30:54,545 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 47 transitions. [2023-11-29 01:30:54,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 47 transitions. [2023-11-29 01:30:54,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2023-11-29 01:30:54,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 38 states have internal predecessors, (45), 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-29 01:30:54,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2023-11-29 01:30:54,548 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 45 transitions. [2023-11-29 01:30:54,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-29 01:30:54,550 INFO L428 stractBuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2023-11-29 01:30:54,550 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-11-29 01:30:54,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 45 transitions. [2023-11-29 01:30:54,551 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2023-11-29 01:30:54,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:30:54,551 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:30:54,551 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:30:54,551 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 01:30:54,552 INFO L748 eck$LassoCheckResult]: Stem: 1446#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1447#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1448#L367 assume !(main_~length~0#1 < 1); 1443#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1444#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 1449#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 1439#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1440#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1441#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1442#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1464#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1463#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1462#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1461#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1460#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1459#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1458#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1457#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1454#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 1450#L375-4 main_~j~0#1 := 1; 1451#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1470#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1469#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1445#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 1434#L380-2 [2023-11-29 01:30:54,552 INFO L750 eck$LassoCheckResult]: Loop: 1434#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1435#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 1434#L380-2 [2023-11-29 01:30:54,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:30:54,552 INFO L85 PathProgramCache]: Analyzing trace with hash -885753430, now seen corresponding path program 5 times [2023-11-29 01:30:54,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:30:54,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981769907] [2023-11-29 01:30:54,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:30:54,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:30:54,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:30:55,179 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:30:55,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:30:55,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981769907] [2023-11-29 01:30:55,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981769907] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:30:55,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989601419] [2023-11-29 01:30:55,180 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 01:30:55,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:30:55,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:30:55,183 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:30:55,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2023-11-29 01:30:55,263 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2023-11-29 01:30:55,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:30:55,264 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-29 01:30:55,267 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:30:55,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:30:55,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2023-11-29 01:30:55,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:30:55,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:30:55,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:30:55,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 20 [2023-11-29 01:30:55,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:30:55,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:30:55,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:30:55,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 20 [2023-11-29 01:30:55,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:30:55,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:30:55,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:30:55,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 20 [2023-11-29 01:30:55,696 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:30:55,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2023-11-29 01:30:55,699 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:30:55,699 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:30:56,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2023-11-29 01:30:56,113 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:30:56,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 191 treesize of output 159 [2023-11-29 01:30:56,136 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 29 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 01:30:56,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989601419] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:30:56,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:30:56,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 13] total 31 [2023-11-29 01:30:56,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280187858] [2023-11-29 01:30:56,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:30:56,138 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 01:30:56,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:30:56,138 INFO L85 PathProgramCache]: Analyzing trace with hash 2438, now seen corresponding path program 1 times [2023-11-29 01:30:56,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:30:56,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606306531] [2023-11-29 01:30:56,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:30:56,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:30:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:30:56,141 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:30:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:30:56,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:30:56,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:30:56,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-29 01:30:56,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=843, Unknown=0, NotChecked=0, Total=992 [2023-11-29 01:30:56,235 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. cyclomatic complexity: 11 Second operand has 32 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 32 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-29 01:30:56,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:30:56,538 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2023-11-29 01:30:56,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 40 transitions. [2023-11-29 01:30:56,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 01:30:56,538 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 31 states and 34 transitions. [2023-11-29 01:30:56,539 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2023-11-29 01:30:56,539 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2023-11-29 01:30:56,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 34 transitions. [2023-11-29 01:30:56,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:30:56,539 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 34 transitions. [2023-11-29 01:30:56,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 34 transitions. [2023-11-29 01:30:56,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2023-11-29 01:30:56,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:30:56,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2023-11-29 01:30:56,541 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 33 transitions. [2023-11-29 01:30:56,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 01:30:56,542 INFO L428 stractBuchiCegarLoop]: Abstraction has 30 states and 33 transitions. [2023-11-29 01:30:56,542 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-11-29 01:30:56,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 33 transitions. [2023-11-29 01:30:56,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 01:30:56,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:30:56,543 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:30:56,544 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:30:56,544 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 01:30:56,544 INFO L748 eck$LassoCheckResult]: Stem: 1703#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1704#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1705#L367 assume !(main_~length~0#1 < 1); 1699#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1700#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 1706#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 1695#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1696#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1697#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1698#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1718#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1717#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1716#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1715#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1714#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1713#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1712#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1711#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1710#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1709#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1708#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 1707#L375-4 main_~j~0#1 := 1; 1691#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1692#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1693#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1694#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1719#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1701#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 1702#L380-2 [2023-11-29 01:30:56,544 INFO L750 eck$LassoCheckResult]: Loop: 1702#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1720#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1702#L380-2 [2023-11-29 01:30:56,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:30:56,544 INFO L85 PathProgramCache]: Analyzing trace with hash -93884209, now seen corresponding path program 6 times [2023-11-29 01:30:56,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:30:56,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685922786] [2023-11-29 01:30:56,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:30:56,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:30:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:30:57,353 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 2 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:30:57,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:30:57,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685922786] [2023-11-29 01:30:57,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685922786] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:30:57,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764604023] [2023-11-29 01:30:57,354 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-29 01:30:57,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:30:57,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:30:57,355 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:30:57,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2023-11-29 01:30:57,459 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2023-11-29 01:30:57,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:30:57,461 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-29 01:30:57,466 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:30:57,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:30:57,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2023-11-29 01:30:57,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:30:57,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:30:57,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:30:57,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 20 [2023-11-29 01:30:57,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:30:57,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:30:57,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:30:57,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 20 [2023-11-29 01:30:57,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:30:57,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:30:57,826 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:30:57,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 20 [2023-11-29 01:30:58,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:30:58,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2023-11-29 01:30:58,057 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 6 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:30:58,057 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:31:01,726 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_211 Int) (|v_ULTIMATE.start_main_~i~0#1_87| Int) (v_ArrVal_209 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_87| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (let ((.cse0 (store (store (select |c_#memory_int#0| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_209) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_87| 4)) v_ArrVal_211))) (< (select .cse0 (+ |c_ULTIMATE.start_main_~arr~0#1.offset| 8)) (select .cse0 (+ |c_ULTIMATE.start_main_~arr~0#1.offset| 12)))) (< |v_ULTIMATE.start_main_~i~0#1_87| 3))) is different from false [2023-11-29 01:31:13,748 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_88| Int)) (or (forall ((v_ArrVal_211 Int) (|v_ULTIMATE.start_main_~i~0#1_87| Int) (v_ArrVal_209 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_87| (+ |v_ULTIMATE.start_main_~i~0#1_88| 1)) (let ((.cse0 (store (store (select |c_#memory_int#0| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_88| 4)) v_ArrVal_209) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_87| 4)) v_ArrVal_211))) (< (select .cse0 (+ |c_ULTIMATE.start_main_~arr~0#1.offset| 8)) (select .cse0 (+ |c_ULTIMATE.start_main_~arr~0#1.offset| 12)))) (< |v_ULTIMATE.start_main_~i~0#1_87| 3))) (< |v_ULTIMATE.start_main_~i~0#1_88| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2023-11-29 01:31:18,477 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_211 Int) (|v_ULTIMATE.start_main_~i~0#1_88| Int) (|v_ULTIMATE.start_main_~i~0#1_87| Int) (v_ArrVal_209 Int) (v_ArrVal_207 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_87| (+ |v_ULTIMATE.start_main_~i~0#1_88| 1)) (< |v_ULTIMATE.start_main_~i~0#1_88| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (let ((.cse0 (store (store (store (select |c_#memory_int#0| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_207) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_88| 4)) v_ArrVal_209) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_87| 4)) v_ArrVal_211))) (< (select .cse0 (+ |c_ULTIMATE.start_main_~arr~0#1.offset| 8)) (select .cse0 (+ |c_ULTIMATE.start_main_~arr~0#1.offset| 12)))) (< |v_ULTIMATE.start_main_~i~0#1_87| 3))) is different from false [2023-11-29 01:32:53,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 83 [2023-11-29 01:32:53,218 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:32:53,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 191926 treesize of output 185782 [2023-11-29 01:32:54,713 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 3 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 19 not checked. [2023-11-29 01:32:54,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764604023] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:32:54,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:32:54,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 20] total 51 [2023-11-29 01:32:54,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182436059] [2023-11-29 01:32:54,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:32:54,714 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 01:32:54,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:32:54,714 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 9 times [2023-11-29 01:32:54,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:32:54,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503092647] [2023-11-29 01:32:54,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:32:54,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:32:54,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:32:54,717 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:32:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:32:54,719 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:32:54,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:32:54,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-11-29 01:32:54,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=2045, Unknown=15, NotChecked=288, Total=2652 [2023-11-29 01:32:54,791 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. cyclomatic complexity: 6 Second operand has 52 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 52 states have internal predecessors, (76), 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-29 01:32:55,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:32:55,899 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2023-11-29 01:32:55,899 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 37 transitions. [2023-11-29 01:32:55,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 01:32:55,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 36 transitions. [2023-11-29 01:32:55,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2023-11-29 01:32:55,900 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2023-11-29 01:32:55,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 36 transitions. [2023-11-29 01:32:55,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:32:55,900 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 36 transitions. [2023-11-29 01:32:55,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 36 transitions. [2023-11-29 01:32:55,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2023-11-29 01:32:55,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:32:55,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2023-11-29 01:32:55,903 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 35 transitions. [2023-11-29 01:32:55,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 01:32:55,903 INFO L428 stractBuchiCegarLoop]: Abstraction has 32 states and 35 transitions. [2023-11-29 01:32:55,904 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-11-29 01:32:55,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 35 transitions. [2023-11-29 01:32:55,904 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 01:32:55,904 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:32:55,904 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:32:55,905 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:32:55,905 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 01:32:55,905 INFO L748 eck$LassoCheckResult]: Stem: 2017#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2018#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2019#L367 assume !(main_~length~0#1 < 1); 2008#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2009#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 2020#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 2010#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 2011#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2012#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 2013#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2032#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 2031#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2030#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 2029#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2028#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 2027#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2026#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 2025#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2024#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 2023#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2022#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 2021#L375-4 main_~j~0#1 := 1; 2004#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2005#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2006#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2007#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2016#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2035#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2034#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2014#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 2015#L380-2 [2023-11-29 01:32:55,905 INFO L750 eck$LassoCheckResult]: Loop: 2015#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2033#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2015#L380-2 [2023-11-29 01:32:55,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:32:55,906 INFO L85 PathProgramCache]: Analyzing trace with hash -28412078, now seen corresponding path program 7 times [2023-11-29 01:32:55,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:32:55,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110326101] [2023-11-29 01:32:55,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:32:55,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:32:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:32:56,614 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:32:56,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:32:56,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110326101] [2023-11-29 01:32:56,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110326101] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:32:56,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319462246] [2023-11-29 01:32:56,615 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-29 01:32:56,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:32:56,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:32:56,618 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:32:56,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2023-11-29 01:32:56,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:32:56,708 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-29 01:32:56,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:32:56,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:32:56,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2023-11-29 01:32:56,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:32:56,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:32:56,990 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:56,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 20 [2023-11-29 01:32:57,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:32:57,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:32:57,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:57,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 20 [2023-11-29 01:32:57,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:57,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2023-11-29 01:32:57,268 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 1 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:32:57,269 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:32:57,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2023-11-29 01:32:57,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:57,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 693 treesize of output 565 [2023-11-29 01:32:57,733 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 57 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 01:32:57,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319462246] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:32:57,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:32:57,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 17] total 37 [2023-11-29 01:32:57,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744424851] [2023-11-29 01:32:57,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:32:57,734 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 01:32:57,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:32:57,734 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 10 times [2023-11-29 01:32:57,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:32:57,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576002308] [2023-11-29 01:32:57,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:32:57,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:32:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:32:57,737 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:32:57,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:32:57,739 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:32:57,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:32:57,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-29 01:32:57,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1251, Unknown=0, NotChecked=0, Total=1406 [2023-11-29 01:32:57,806 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. cyclomatic complexity: 6 Second operand has 38 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 38 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:32:58,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:32:58,350 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2023-11-29 01:32:58,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 39 transitions. [2023-11-29 01:32:58,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 01:32:58,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 35 states and 38 transitions. [2023-11-29 01:32:58,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2023-11-29 01:32:58,352 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2023-11-29 01:32:58,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 38 transitions. [2023-11-29 01:32:58,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:32:58,352 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 38 transitions. [2023-11-29 01:32:58,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 38 transitions. [2023-11-29 01:32:58,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2023-11-29 01:32:58,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 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-29 01:32:58,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2023-11-29 01:32:58,355 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 37 transitions. [2023-11-29 01:32:58,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 01:32:58,356 INFO L428 stractBuchiCegarLoop]: Abstraction has 34 states and 37 transitions. [2023-11-29 01:32:58,356 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-11-29 01:32:58,356 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 37 transitions. [2023-11-29 01:32:58,357 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 01:32:58,357 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:32:58,357 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:32:58,358 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:32:58,358 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 01:32:58,358 INFO L748 eck$LassoCheckResult]: Stem: 2312#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2313#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2314#L367 assume !(main_~length~0#1 < 1); 2303#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2304#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 2315#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 2305#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 2306#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2307#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 2308#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2327#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 2326#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2325#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 2324#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2323#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 2322#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2321#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 2320#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2319#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 2318#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2317#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 2316#L375-4 main_~j~0#1 := 1; 2299#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2300#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2301#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2302#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2311#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2332#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2331#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2330#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2329#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2309#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 2310#L380-2 [2023-11-29 01:32:58,358 INFO L750 eck$LassoCheckResult]: Loop: 2310#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2328#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2310#L380-2 [2023-11-29 01:32:58,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:32:58,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1534203627, now seen corresponding path program 8 times [2023-11-29 01:32:58,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:32:58,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653844346] [2023-11-29 01:32:58,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:32:58,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:32:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:32:59,045 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:32:59,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:32:59,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653844346] [2023-11-29 01:32:59,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653844346] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:32:59,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884594291] [2023-11-29 01:32:59,045 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:32:59,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:32:59,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:32:59,047 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:32:59,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2023-11-29 01:32:59,139 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:32:59,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:32:59,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-29 01:32:59,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:32:59,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:32:59,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2023-11-29 01:32:59,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:32:59,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:32:59,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:59,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 20 [2023-11-29 01:32:59,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:32:59,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2023-11-29 01:32:59,810 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:32:59,811 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:33:00,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2023-11-29 01:33:00,280 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:33:00,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 385 treesize of output 321 [2023-11-29 01:33:00,301 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 1 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:33:00,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884594291] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:33:00,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:33:00,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 18] total 39 [2023-11-29 01:33:00,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113327523] [2023-11-29 01:33:00,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:33:00,302 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 01:33:00,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:33:00,302 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 11 times [2023-11-29 01:33:00,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:33:00,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728411371] [2023-11-29 01:33:00,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:33:00,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:33:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:33:00,305 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:33:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:33:00,308 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:33:00,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:33:00,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-11-29 01:33:00,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1410, Unknown=0, NotChecked=0, Total=1560 [2023-11-29 01:33:00,381 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. cyclomatic complexity: 6 Second operand has 40 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 40 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:33:01,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:33:01,035 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2023-11-29 01:33:01,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 41 transitions. [2023-11-29 01:33:01,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 01:33:01,035 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 37 states and 40 transitions. [2023-11-29 01:33:01,035 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2023-11-29 01:33:01,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2023-11-29 01:33:01,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 40 transitions. [2023-11-29 01:33:01,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:33:01,036 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 40 transitions. [2023-11-29 01:33:01,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 40 transitions. [2023-11-29 01:33:01,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2023-11-29 01:33:01,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 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-29 01:33:01,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2023-11-29 01:33:01,038 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 39 transitions. [2023-11-29 01:33:01,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 01:33:01,039 INFO L428 stractBuchiCegarLoop]: Abstraction has 36 states and 39 transitions. [2023-11-29 01:33:01,039 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2023-11-29 01:33:01,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 39 transitions. [2023-11-29 01:33:01,039 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 01:33:01,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:33:01,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:33:01,040 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:33:01,040 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 01:33:01,040 INFO L748 eck$LassoCheckResult]: Stem: 2627#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2628#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2629#L367 assume !(main_~length~0#1 < 1); 2618#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2619#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);havoc main_#t~nondet207#1;main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 2630#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 2620#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 2621#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2622#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 2623#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2642#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 2641#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2640#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 2639#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2638#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 2637#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2636#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 2635#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2634#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int#0(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 2633#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2632#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 2631#L375-4 main_~j~0#1 := 1; 2614#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2615#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2616#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2617#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2626#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2649#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2648#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2647#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2646#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2645#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2644#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2624#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 2625#L380-2 [2023-11-29 01:33:01,040 INFO L750 eck$LassoCheckResult]: Loop: 2625#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2643#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2625#L380-2 [2023-11-29 01:33:01,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:33:01,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1195903464, now seen corresponding path program 9 times [2023-11-29 01:33:01,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:33:01,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135042553] [2023-11-29 01:33:01,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:33:01,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:33:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:33:01,920 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:33:01,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:33:01,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135042553] [2023-11-29 01:33:01,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135042553] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:33:01,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928740432] [2023-11-29 01:33:01,920 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 01:33:01,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:33:01,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:33:01,922 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:33:01,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2023-11-29 01:33:02,042 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-11-29 01:33:02,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:33:02,044 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-29 01:33:02,048 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:33:02,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-29 01:33:02,319 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2023-11-29 01:33:02,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2023-11-29 01:33:03,202 INFO L349 Elim1Store]: treesize reduction 38, result has 15.6 percent of original size [2023-11-29 01:33:03,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 36 [2023-11-29 01:33:03,207 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 25 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:33:03,208 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:33:45,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2023-11-29 01:33:45,361 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:33:45,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 494 treesize of output 390 [2023-11-29 01:33:45,559 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 16 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:33:45,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928740432] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:33:45,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:33:45,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 19] total 50 [2023-11-29 01:33:45,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514601319] [2023-11-29 01:33:45,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:33:45,560 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 01:33:45,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:33:45,560 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 12 times [2023-11-29 01:33:45,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:33:45,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615789777] [2023-11-29 01:33:45,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:33:45,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:33:45,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:33:45,563 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:33:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:33:45,566 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:33:45,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:33:45,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-11-29 01:33:45,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=2226, Unknown=5, NotChecked=0, Total=2550 [2023-11-29 01:33:45,638 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. cyclomatic complexity: 6 Second operand has 51 states, 50 states have (on average 1.62) internal successors, (81), 51 states have internal predecessors, (81), 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-29 01:33:57,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:34:05,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 7.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 01:34:15,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.81s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 01:34:27,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 12.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 01:34:39,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 12.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 01:34:54,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 01:34:57,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.80s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 01:35:29,485 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 101 [2023-11-29 01:35:29,485 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-11-29 01:35:29,486 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkValidity(IncrementalHoareTripleChecker.java:680) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:145) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:460) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:104) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:210) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.BuchiAutomatonCegarLoop.refineFinite(BuchiAutomatonCegarLoop.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.BuchiAutomatonCegarLoop.refineFinite(BuchiAutomatonCegarLoop.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.refineFiniteInternal(AbstractBuchiCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:401) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:136) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:157) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:341) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 42 more [2023-11-29 01:35:29,489 INFO L158 Benchmark]: Toolchain (without parser) took 502672.33ms. Allocated memory was 153.1MB in the beginning and 222.3MB in the end (delta: 69.2MB). Free memory was 114.4MB in the beginning and 166.3MB in the end (delta: -52.0MB). Peak memory consumption was 128.1MB. Max. memory is 16.1GB. [2023-11-29 01:35:29,489 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 111.1MB. Free memory is still 85.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:35:29,489 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.77ms. Allocated memory is still 153.1MB. Free memory was 114.4MB in the beginning and 96.6MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 01:35:29,490 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.89ms. Allocated memory is still 153.1MB. Free memory was 96.6MB in the beginning and 94.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 01:35:29,490 INFO L158 Benchmark]: Boogie Preprocessor took 36.78ms. Allocated memory is still 153.1MB. Free memory was 94.9MB in the beginning and 92.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 01:35:29,490 INFO L158 Benchmark]: RCFGBuilder took 313.22ms. Allocated memory is still 153.1MB. Free memory was 92.9MB in the beginning and 119.7MB in the end (delta: -26.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 01:35:29,491 INFO L158 Benchmark]: BuchiAutomizer took 501922.13ms. Allocated memory was 153.1MB in the beginning and 222.3MB in the end (delta: 69.2MB). Free memory was 119.3MB in the beginning and 166.3MB in the end (delta: -47.0MB). Peak memory consumption was 136.0MB. Max. memory is 16.1GB. [2023-11-29 01:35:29,492 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 111.1MB. Free memory is still 85.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.77ms. Allocated memory is still 153.1MB. Free memory was 114.4MB in the beginning and 96.6MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.89ms. Allocated memory is still 153.1MB. Free memory was 96.6MB in the beginning and 94.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.78ms. Allocated memory is still 153.1MB. Free memory was 94.9MB in the beginning and 92.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 313.22ms. Allocated memory is still 153.1MB. Free memory was 92.9MB in the beginning and 119.7MB in the end (delta: -26.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 501922.13ms. Allocated memory was 153.1MB in the beginning and 222.3MB in the end (delta: 69.2MB). Free memory was 119.3MB in the beginning and 166.3MB in the end (delta: -47.0MB). Peak memory consumption was 136.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[#t~malloc206!base] could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-29 01:35:29,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2023-11-29 01:35:29,704 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2023-11-29 01:35:29,904 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2023-11-29 01:35:30,105 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2023-11-29 01:35:30,305 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2023-11-29 01:35:30,505 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2023-11-29 01:35:30,705 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2023-11-29 01:35:30,905 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2023-11-29 01:35:31,105 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2023-11-29 01:35:31,305 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2023-11-29 01:35:31,505 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef1e9ab0-20ab-4770-9631-4ed9b41a35e2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")