./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/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_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/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_cd4a3fc3-ece8-4010-9dcf-aadb29956097/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 a88178fc87721f9fcc743f79bc2a47ff45a89438b0709780ae0f715015934520 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:01:58,152 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:01:58,217 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-11-29 00:01:58,222 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:01:58,223 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:01:58,248 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:01:58,249 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:01:58,250 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:01:58,250 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:01:58,251 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:01:58,252 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:01:58,252 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:01:58,253 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:01:58,253 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-29 00:01:58,254 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-29 00:01:58,254 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-29 00:01:58,255 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-29 00:01:58,255 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-29 00:01:58,256 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-29 00:01:58,256 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:01:58,257 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-29 00:01:58,273 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:01:58,274 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:01:58,274 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-29 00:01:58,275 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-29 00:01:58,275 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-29 00:01:58,275 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 00:01:58,276 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:01:58,276 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-29 00:01:58,277 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:01:58,277 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:01:58,277 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:01:58,278 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:01:58,278 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:01:58,279 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-29 00:01:58,279 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_cd4a3fc3-ece8-4010-9dcf-aadb29956097/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_cd4a3fc3-ece8-4010-9dcf-aadb29956097/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 -> a88178fc87721f9fcc743f79bc2a47ff45a89438b0709780ae0f715015934520 [2023-11-29 00:01:58,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:01:58,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:01:58,544 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:01:58,545 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:01:58,545 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:01:58,546 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i [2023-11-29 00:02:01,372 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:02:01,586 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:02:01,586 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i [2023-11-29 00:02:01,598 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/data/abd82c120/682e27ac72ea485faf40b8f7fdce5204/FLAG008e24e7f [2023-11-29 00:02:01,609 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/data/abd82c120/682e27ac72ea485faf40b8f7fdce5204 [2023-11-29 00:02:01,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:02:01,612 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:02:01,613 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:02:01,613 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:02:01,617 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:02:01,618 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:02:01" (1/1) ... [2023-11-29 00:02:01,619 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e257671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:01, skipping insertion in model container [2023-11-29 00:02:01,619 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:02:01" (1/1) ... [2023-11-29 00:02:01,664 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:02:01,913 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:02:01,926 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:02:01,965 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:02:01,993 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:02:01,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:01 WrapperNode [2023-11-29 00:02:01,994 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:02:01,995 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:02:01,995 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:02:01,995 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:02:02,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:01" (1/1) ... [2023-11-29 00:02:02,016 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:01" (1/1) ... [2023-11-29 00:02:02,037 INFO L138 Inliner]: procedures = 111, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2023-11-29 00:02:02,037 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:02:02,038 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:02:02,038 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:02:02,038 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:02:02,048 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:01" (1/1) ... [2023-11-29 00:02:02,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:01" (1/1) ... [2023-11-29 00:02:02,051 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:01" (1/1) ... [2023-11-29 00:02:02,064 INFO L175 MemorySlicer]: Split 7 memory accesses to 1 slices as follows [7]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 3 writes are split as follows [3]. [2023-11-29 00:02:02,065 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:01" (1/1) ... [2023-11-29 00:02:02,065 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:01" (1/1) ... [2023-11-29 00:02:02,071 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:01" (1/1) ... [2023-11-29 00:02:02,075 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:01" (1/1) ... [2023-11-29 00:02:02,076 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:01" (1/1) ... [2023-11-29 00:02:02,077 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:01" (1/1) ... [2023-11-29 00:02:02,080 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:02:02,081 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:02:02,081 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:02:02,081 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:02:02,082 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:01" (1/1) ... [2023-11-29 00:02:02,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:02,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:02,113 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:02,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-29 00:02:02,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 00:02:02,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 00:02:02,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 00:02:02,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:02:02,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:02:02,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:02:02,270 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:02:02,272 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:02:02,379 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:02:02,389 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:02:02,389 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-29 00:02:02,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:02:02 BoogieIcfgContainer [2023-11-29 00:02:02,390 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:02:02,391 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-29 00:02:02,392 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-29 00:02:02,395 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-29 00:02:02,396 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 00:02:02,396 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:02:01" (1/3) ... [2023-11-29 00:02:02,397 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@288224b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:02:02, skipping insertion in model container [2023-11-29 00:02:02,397 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 00:02:02,397 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:01" (2/3) ... [2023-11-29 00:02:02,398 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@288224b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:02:02, skipping insertion in model container [2023-11-29 00:02:02,398 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 00:02:02,398 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:02:02" (3/3) ... [2023-11-29 00:02:02,399 INFO L332 chiAutomizerObserver]: Analyzing ICFG java_BubbleSort-alloca-2.i [2023-11-29 00:02:02,463 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-29 00:02:02,463 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-29 00:02:02,463 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-29 00:02:02,464 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-29 00:02:02,464 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-29 00:02:02,464 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-29 00:02:02,464 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-29 00:02:02,464 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-29 00:02:02,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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 00:02:02,486 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2023-11-29 00:02:02,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:02:02,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:02:02,491 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-11-29 00:02:02,491 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 00:02:02,491 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-29 00:02:02,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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 00:02:02,494 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2023-11-29 00:02:02,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:02:02,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:02:02,494 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-11-29 00:02:02,494 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 00:02:02,503 INFO L748 eck$LassoCheckResult]: Stem: 13#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 12#L558true assume !(main_~array_size~0#1 < 1); 6#L558-2true call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 14#L562-3true [2023-11-29 00:02:02,504 INFO L750 eck$LassoCheckResult]: Loop: 14#L562-3true assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 16#L562-2true main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 14#L562-3true [2023-11-29 00:02:02,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:02,510 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2023-11-29 00:02:02,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:02,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770726803] [2023-11-29 00:02:02,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:02,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:02,638 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:02:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:02,672 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:02:02,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:02,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2023-11-29 00:02:02,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:02,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547076366] [2023-11-29 00:02:02,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:02,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:02,692 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:02:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:02,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:02:02,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:02,705 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2023-11-29 00:02:02,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:02,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715981298] [2023-11-29 00:02:02,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:02,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:02,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:02,734 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:02:02,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:02,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:02:03,103 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 00:02:03,103 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 00:02:03,103 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 00:02:03,104 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 00:02:03,104 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 00:02:03,104 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:03,104 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 00:02:03,104 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 00:02:03,104 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration1_Lasso [2023-11-29 00:02:03,104 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 00:02:03,105 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 00:02:03,124 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 00:02:03,134 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 00:02:03,137 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 00:02:03,141 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 00:02:03,294 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 00:02:03,298 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 00:02:03,300 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 00:02:03,304 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 00:02:03,307 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 00:02:03,589 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 00:02:03,592 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 00:02:03,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:03,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:03,596 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:03,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-29 00:02:03,603 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 00:02:03,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:03,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:03,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:03,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:03,619 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:02:03,620 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:02:03,625 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:03,632 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-11-29 00:02:03,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:03,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:03,634 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:03,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-29 00:02:03,641 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 00:02:03,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:03,653 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 00:02:03,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:03,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:03,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:03,654 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 00:02:03,654 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 00:02:03,656 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:03,659 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-11-29 00:02:03,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:03,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:03,661 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:03,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-29 00:02:03,664 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 00:02:03,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:03,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:03,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:03,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:03,679 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:02:03,680 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:02:03,684 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:03,688 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-11-29 00:02:03,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:03,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:03,689 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:03,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-11-29 00:02:03,692 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 00:02:03,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:03,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:03,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:03,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:03,707 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:02:03,708 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:02:03,713 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:03,719 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2023-11-29 00:02:03,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:03,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:03,721 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:03,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-11-29 00:02:03,727 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 00:02:03,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:03,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:03,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:03,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:03,749 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:02:03,749 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:02:03,767 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 00:02:03,821 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2023-11-29 00:02:03,821 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 15 variables to zero. [2023-11-29 00:02:03,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:03,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:03,849 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:03,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-11-29 00:02:03,857 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 00:02:03,871 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-29 00:02:03,872 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 00:02:03,872 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~array_size~0#1, ULTIMATE.start_main_~i~1#1) = 1*ULTIMATE.start_main_~array_size~0#1 - 1*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2023-11-29 00:02:03,876 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-11-29 00:02:03,889 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2023-11-29 00:02:03,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:03,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:03,930 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 00:02:03,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:02:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:03,949 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:02:03,950 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:02:03,966 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 00:02:03,999 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 00:02:04,001 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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.0) internal successors, (6), 3 states have internal predecessors, (6), 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 00:02:04,047 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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.0) internal successors, (6), 3 states have internal predecessors, (6), 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 29 states and 44 transitions. Complement of second has 8 states. [2023-11-29 00:02:04,049 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 00:02:04,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 00:02:04,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2023-11-29 00:02:04,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 4 letters. Loop has 2 letters. [2023-11-29 00:02:04,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 00:02:04,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 6 letters. Loop has 2 letters. [2023-11-29 00:02:04,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 00:02:04,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 4 letters. Loop has 4 letters. [2023-11-29 00:02:04,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 00:02:04,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 44 transitions. [2023-11-29 00:02:04,073 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2023-11-29 00:02:04,074 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-11-29 00:02:04,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 13 states and 19 transitions. [2023-11-29 00:02:04,079 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2023-11-29 00:02:04,079 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2023-11-29 00:02:04,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2023-11-29 00:02:04,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:02:04,080 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 19 transitions. [2023-11-29 00:02:04,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2023-11-29 00:02:04,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-11-29 00:02:04,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:02:04,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2023-11-29 00:02:04,107 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 19 transitions. [2023-11-29 00:02:04,107 INFO L428 stractBuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2023-11-29 00:02:04,107 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-29 00:02:04,107 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2023-11-29 00:02:04,108 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-11-29 00:02:04,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:02:04,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:02:04,109 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-11-29 00:02:04,109 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-29 00:02:04,109 INFO L748 eck$LassoCheckResult]: Stem: 110#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 111#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 106#L558 assume !(main_~array_size~0#1 < 1); 107#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 112#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 102#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 103#L550-3 [2023-11-29 00:02:04,109 INFO L750 eck$LassoCheckResult]: Loop: 103#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 105#L551-3 assume !true; 108#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 103#L550-3 [2023-11-29 00:02:04,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:04,110 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2023-11-29 00:02:04,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:04,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535421507] [2023-11-29 00:02:04,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:04,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:04,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:04,202 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 00:02:04,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:02:04,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535421507] [2023-11-29 00:02:04,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535421507] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:02:04,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:02:04,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:02:04,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296636773] [2023-11-29 00:02:04,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:02:04,207 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 00:02:04,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:04,207 INFO L85 PathProgramCache]: Analyzing trace with hash 61120, now seen corresponding path program 1 times [2023-11-29 00:02:04,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:04,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998037654] [2023-11-29 00:02:04,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:04,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:04,215 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 00:02:04,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:02:04,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998037654] [2023-11-29 00:02:04,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998037654] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:02:04,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:02:04,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:02:04,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481886727] [2023-11-29 00:02:04,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:02:04,217 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 00:02:04,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:02:04,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 00:02:04,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:02:04,222 INFO L87 Difference]: Start difference. First operand 13 states and 19 transitions. cyclomatic complexity: 8 Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 00:02:04,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:02:04,227 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2023-11-29 00:02:04,227 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 18 transitions. [2023-11-29 00:02:04,228 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-11-29 00:02:04,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 18 transitions. [2023-11-29 00:02:04,229 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2023-11-29 00:02:04,229 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2023-11-29 00:02:04,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2023-11-29 00:02:04,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:02:04,229 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2023-11-29 00:02:04,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2023-11-29 00:02:04,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-11-29 00:02:04,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:02:04,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2023-11-29 00:02:04,231 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2023-11-29 00:02:04,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 00:02:04,232 INFO L428 stractBuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2023-11-29 00:02:04,232 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-29 00:02:04,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2023-11-29 00:02:04,233 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-11-29 00:02:04,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:02:04,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:02:04,234 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-11-29 00:02:04,234 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-29 00:02:04,234 INFO L748 eck$LassoCheckResult]: Stem: 143#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 144#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 139#L558 assume !(main_~array_size~0#1 < 1); 140#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 145#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 135#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 136#L550-3 [2023-11-29 00:02:04,234 INFO L750 eck$LassoCheckResult]: Loop: 136#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 138#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 141#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 136#L550-3 [2023-11-29 00:02:04,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:04,235 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 2 times [2023-11-29 00:02:04,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:04,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858879253] [2023-11-29 00:02:04,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:04,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:04,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:04,290 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 00:02:04,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:02:04,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858879253] [2023-11-29 00:02:04,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858879253] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:02:04,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:02:04,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:02:04,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915009936] [2023-11-29 00:02:04,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:02:04,292 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 00:02:04,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:04,292 INFO L85 PathProgramCache]: Analyzing trace with hash 60779, now seen corresponding path program 1 times [2023-11-29 00:02:04,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:04,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392782188] [2023-11-29 00:02:04,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:04,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:04,315 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 00:02:04,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:02:04,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392782188] [2023-11-29 00:02:04,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392782188] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:02:04,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:02:04,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:02:04,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156663446] [2023-11-29 00:02:04,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:02:04,316 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 00:02:04,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:02:04,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:02:04,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:02:04,317 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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 00:02:04,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:02:04,332 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2023-11-29 00:02:04,332 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2023-11-29 00:02:04,332 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-11-29 00:02:04,333 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2023-11-29 00:02:04,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2023-11-29 00:02:04,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2023-11-29 00:02:04,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2023-11-29 00:02:04,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:02:04,334 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2023-11-29 00:02:04,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2023-11-29 00:02:04,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-11-29 00:02:04,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:02:04,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2023-11-29 00:02:04,336 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2023-11-29 00:02:04,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:02:04,337 INFO L428 stractBuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2023-11-29 00:02:04,337 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-29 00:02:04,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2023-11-29 00:02:04,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-11-29 00:02:04,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:02:04,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:02:04,339 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-11-29 00:02:04,339 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-11-29 00:02:04,339 INFO L748 eck$LassoCheckResult]: Stem: 178#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 179#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 174#L558 assume !(main_~array_size~0#1 < 1); 175#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 180#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 170#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 171#L550-3 [2023-11-29 00:02:04,339 INFO L750 eck$LassoCheckResult]: Loop: 171#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 176#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 177#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 172#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 173#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 183#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 171#L550-3 [2023-11-29 00:02:04,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:04,340 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 3 times [2023-11-29 00:02:04,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:04,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663992524] [2023-11-29 00:02:04,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:04,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:04,388 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 00:02:04,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:02:04,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663992524] [2023-11-29 00:02:04,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663992524] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:02:04,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:02:04,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:02:04,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60305724] [2023-11-29 00:02:04,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:02:04,389 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 00:02:04,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:04,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 1 times [2023-11-29 00:02:04,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:04,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829830210] [2023-11-29 00:02:04,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:04,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:04,401 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:02:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:04,410 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:02:04,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:02:04,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:02:04,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:02:04,558 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 00:02:04,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:02:04,582 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2023-11-29 00:02:04,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2023-11-29 00:02:04,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-11-29 00:02:04,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2023-11-29 00:02:04,584 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2023-11-29 00:02:04,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2023-11-29 00:02:04,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2023-11-29 00:02:04,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:02:04,585 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2023-11-29 00:02:04,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2023-11-29 00:02:04,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2023-11-29 00:02:04,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:02:04,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2023-11-29 00:02:04,587 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 18 transitions. [2023-11-29 00:02:04,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:02:04,588 INFO L428 stractBuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2023-11-29 00:02:04,588 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-29 00:02:04,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2023-11-29 00:02:04,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-11-29 00:02:04,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:02:04,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:02:04,590 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:02:04,590 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-11-29 00:02:04,590 INFO L748 eck$LassoCheckResult]: Stem: 214#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 215#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 210#L558 assume !(main_~array_size~0#1 < 1); 211#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 216#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 217#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 218#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 206#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 207#L550-3 [2023-11-29 00:02:04,590 INFO L750 eck$LassoCheckResult]: Loop: 207#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 212#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 213#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 208#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 209#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 219#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 207#L550-3 [2023-11-29 00:02:04,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:04,591 INFO L85 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2023-11-29 00:02:04,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:04,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513828889] [2023-11-29 00:02:04,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:04,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:04,606 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:02:04,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:04,619 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:02:04,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:04,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 2 times [2023-11-29 00:02:04,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:04,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798692025] [2023-11-29 00:02:04,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:04,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:04,630 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:02:04,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:04,638 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:02:04,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:04,639 INFO L85 PathProgramCache]: Analyzing trace with hash -256077176, now seen corresponding path program 1 times [2023-11-29 00:02:04,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:04,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952135895] [2023-11-29 00:02:04,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:04,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:04,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:04,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:02:04,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:02:04,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952135895] [2023-11-29 00:02:04,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952135895] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:02:04,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407485800] [2023-11-29 00:02:04,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:04,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:02:04,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:04,775 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:02:04,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 00:02:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:04,856 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 00:02:04,857 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:02:04,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:02:04,899 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:02:04,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:02:04,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407485800] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:02:04,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:02:04,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2023-11-29 00:02:04,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148587123] [2023-11-29 00:02:04,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:02:05,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:02:05,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:02:05,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:02:05,084 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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 00:02:05,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:02:05,180 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2023-11-29 00:02:05,180 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2023-11-29 00:02:05,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-11-29 00:02:05,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 17 states and 20 transitions. [2023-11-29 00:02:05,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2023-11-29 00:02:05,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2023-11-29 00:02:05,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2023-11-29 00:02:05,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:02:05,183 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 20 transitions. [2023-11-29 00:02:05,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2023-11-29 00:02:05,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2023-11-29 00:02:05,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:02:05,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2023-11-29 00:02:05,186 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2023-11-29 00:02:05,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:02:05,187 INFO L428 stractBuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2023-11-29 00:02:05,187 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-29 00:02:05,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2023-11-29 00:02:05,188 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-11-29 00:02:05,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:02:05,188 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:02:05,189 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2023-11-29 00:02:05,189 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-11-29 00:02:05,189 INFO L748 eck$LassoCheckResult]: Stem: 352#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 353#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 348#L558 assume !(main_~array_size~0#1 < 1); 349#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 354#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 355#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 356#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 357#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 359#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 344#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 345#L550-3 [2023-11-29 00:02:05,189 INFO L750 eck$LassoCheckResult]: Loop: 345#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 350#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 351#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 346#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 347#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 358#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 345#L550-3 [2023-11-29 00:02:05,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:05,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1899756335, now seen corresponding path program 2 times [2023-11-29 00:02:05,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:05,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637630714] [2023-11-29 00:02:05,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:05,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:05,206 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:02:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:05,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:02:05,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:05,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 3 times [2023-11-29 00:02:05,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:05,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727393501] [2023-11-29 00:02:05,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:05,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:05,229 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:02:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:05,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:02:05,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:05,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1808202986, now seen corresponding path program 2 times [2023-11-29 00:02:05,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:05,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390378886] [2023-11-29 00:02:05,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:05,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:05,264 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:02:05,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:05,284 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:02:05,758 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 00:02:05,758 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 00:02:05,758 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 00:02:05,758 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 00:02:05,758 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 00:02:05,758 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:05,758 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 00:02:05,758 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 00:02:05,758 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration6_Lasso [2023-11-29 00:02:05,758 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 00:02:05,759 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 00:02:05,763 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 00:02:05,766 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 00:02:05,770 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 00:02:05,773 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 00:02:05,776 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 00:02:05,779 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 00:02:05,782 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 00:02:05,785 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 00:02:05,787 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 00:02:05,790 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 00:02:05,792 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 00:02:05,796 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 00:02:05,799 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 00:02:05,803 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 00:02:05,805 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 00:02:05,808 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 00:02:05,811 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 00:02:05,814 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 00:02:05,816 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 00:02:05,820 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 00:02:06,525 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 00:02:06,525 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 00:02:06,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:06,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:06,526 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:06,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-11-29 00:02:06,529 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 00:02:06,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:06,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 00:02:06,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:06,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:06,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:06,540 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 00:02:06,540 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 00:02:06,541 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:06,544 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-11-29 00:02:06,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:06,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:06,546 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:06,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-11-29 00:02:06,548 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 00:02:06,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:06,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:06,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:06,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:06,561 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:02:06,561 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:02:06,565 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:06,569 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-11-29 00:02:06,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:06,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:06,570 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:06,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-11-29 00:02:06,573 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 00:02:06,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:06,585 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 00:02:06,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:06,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:06,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:06,585 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 00:02:06,585 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 00:02:06,587 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:06,590 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2023-11-29 00:02:06,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:06,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:06,592 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:06,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-11-29 00:02:06,594 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 00:02:06,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:06,606 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 00:02:06,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:06,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:06,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:06,607 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 00:02:06,607 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 00:02:06,610 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:06,612 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2023-11-29 00:02:06,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:06,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:06,617 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:06,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-11-29 00:02:06,619 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 00:02:06,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:06,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:06,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:06,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:06,633 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:02:06,633 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:02:06,637 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:06,640 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-11-29 00:02:06,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:06,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:06,642 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:06,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-11-29 00:02:06,645 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 00:02:06,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:06,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:06,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:06,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:06,658 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:02:06,658 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:02:06,662 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:06,665 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2023-11-29 00:02:06,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:06,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:06,667 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:06,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-11-29 00:02:06,670 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 00:02:06,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:06,684 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 00:02:06,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:06,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:06,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:06,685 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 00:02:06,685 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 00:02:06,686 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:06,690 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2023-11-29 00:02:06,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:06,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:06,691 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:06,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-11-29 00:02:06,698 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 00:02:06,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:06,711 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 00:02:06,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:06,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:06,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:06,712 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 00:02:06,712 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 00:02:06,714 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:06,721 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2023-11-29 00:02:06,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:06,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:06,724 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:06,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-11-29 00:02:06,731 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 00:02:06,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:06,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 00:02:06,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:06,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:06,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:06,745 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 00:02:06,745 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 00:02:06,747 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:06,750 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2023-11-29 00:02:06,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:06,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:06,752 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:06,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-11-29 00:02:06,756 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 00:02:06,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:06,770 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 00:02:06,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:06,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:06,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:06,772 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 00:02:06,772 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 00:02:06,773 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:06,777 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-11-29 00:02:06,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:06,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:06,779 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:06,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-11-29 00:02:06,783 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 00:02:06,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:06,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:06,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:06,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:06,799 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:02:06,800 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:02:06,804 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:06,808 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2023-11-29 00:02:06,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:06,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:06,809 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:06,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-11-29 00:02:06,813 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 00:02:06,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:06,826 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 00:02:06,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:06,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:06,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:06,827 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 00:02:06,827 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 00:02:06,829 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:06,833 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2023-11-29 00:02:06,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:06,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:06,834 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:06,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-11-29 00:02:06,838 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 00:02:06,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:06,851 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 00:02:06,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:06,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:06,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:06,852 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 00:02:06,852 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 00:02:06,854 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:06,858 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-11-29 00:02:06,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:06,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:06,859 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:06,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-11-29 00:02:06,863 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 00:02:06,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:06,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 00:02:06,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:06,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:06,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:06,877 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 00:02:06,877 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 00:02:06,879 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:06,882 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2023-11-29 00:02:06,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:06,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:06,884 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:06,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-11-29 00:02:06,887 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 00:02:06,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:06,901 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 00:02:06,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:06,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:06,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:06,902 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 00:02:06,902 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 00:02:06,904 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:06,908 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2023-11-29 00:02:06,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:06,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:06,909 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:06,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-11-29 00:02:06,913 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 00:02:06,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:06,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:06,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:06,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:06,929 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:02:06,929 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:02:06,934 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:06,938 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-11-29 00:02:06,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:06,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:06,939 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:06,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-11-29 00:02:06,944 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 00:02:06,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:06,958 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 00:02:06,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:06,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:06,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:06,959 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 00:02:06,959 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 00:02:06,960 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:06,963 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2023-11-29 00:02:06,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:06,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:06,964 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:06,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-11-29 00:02:06,967 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 00:02:06,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:06,978 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 00:02:06,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:06,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:06,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:06,978 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 00:02:06,979 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 00:02:06,980 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:06,983 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2023-11-29 00:02:06,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:06,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:06,984 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:06,985 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-11-29 00:02:06,986 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 00:02:06,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:06,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:06,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:06,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:07,001 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:02:07,001 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:02:07,006 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:07,009 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2023-11-29 00:02:07,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:07,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:07,013 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:07,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-11-29 00:02:07,017 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 00:02:07,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:07,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:07,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:07,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:07,040 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:02:07,040 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:02:07,059 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 00:02:07,143 INFO L443 ModelExtractionUtils]: Simplification made 33 calls to the SMT solver. [2023-11-29 00:02:07,143 INFO L444 ModelExtractionUtils]: 3 out of 28 variables were initially zero. Simplification set additionally 20 variables to zero. [2023-11-29 00:02:07,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:07,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:07,145 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:07,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-11-29 00:02:07,148 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 00:02:07,160 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2023-11-29 00:02:07,161 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 00:02:07,161 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_sort_~x#1.base)_1, ULTIMATE.start_sort_~pass~0#1) = 3*v_rep(select #length ULTIMATE.start_sort_~x#1.base)_1 - 16*ULTIMATE.start_sort_~pass~0#1 Supporting invariants [-1*ULTIMATE.start_sort_~n#1 + 2 >= 0] [2023-11-29 00:02:07,164 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2023-11-29 00:02:07,196 INFO L156 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2023-11-29 00:02:07,199 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[~x!base] could not be translated [2023-11-29 00:02:07,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:07,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 00:02:07,247 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:02:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:07,338 INFO L262 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 00:02:07,339 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:02:07,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:02:07,431 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 3 loop predicates [2023-11-29 00:02:07,431 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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 00:02:07,615 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2023-11-29 00:02:07,619 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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) Result 34 states and 43 transitions. Complement of second has 12 states. [2023-11-29 00:02:07,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 2 non-accepting loop states 2 accepting loop states [2023-11-29 00:02:07,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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 00:02:07,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2023-11-29 00:02:07,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 10 letters. Loop has 6 letters. [2023-11-29 00:02:07,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 00:02:07,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 16 letters. Loop has 6 letters. [2023-11-29 00:02:07,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 00:02:07,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 10 letters. Loop has 12 letters. [2023-11-29 00:02:07,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 00:02:07,622 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 43 transitions. [2023-11-29 00:02:07,623 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2023-11-29 00:02:07,624 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 42 transitions. [2023-11-29 00:02:07,624 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2023-11-29 00:02:07,624 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2023-11-29 00:02:07,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 42 transitions. [2023-11-29 00:02:07,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 00:02:07,625 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 42 transitions. [2023-11-29 00:02:07,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 42 transitions. [2023-11-29 00:02:07,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2023-11-29 00:02:07,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 28 states have internal predecessors, (38), 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 00:02:07,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2023-11-29 00:02:07,628 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 38 transitions. [2023-11-29 00:02:07,628 INFO L428 stractBuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2023-11-29 00:02:07,628 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-29 00:02:07,628 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 38 transitions. [2023-11-29 00:02:07,629 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2023-11-29 00:02:07,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:02:07,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:02:07,630 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:02:07,630 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-29 00:02:07,630 INFO L748 eck$LassoCheckResult]: Stem: 539#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 540#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 534#L558 assume !(main_~array_size~0#1 < 1); 535#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 543#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 544#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 545#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 546#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 554#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 553#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 552#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 531#L551-3 [2023-11-29 00:02:07,630 INFO L750 eck$LassoCheckResult]: Loop: 531#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 536#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 530#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 531#L551-3 [2023-11-29 00:02:07,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:07,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 1 times [2023-11-29 00:02:07,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:07,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068439743] [2023-11-29 00:02:07,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:07,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:07,643 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:02:07,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:07,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:02:07,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:07,655 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2023-11-29 00:02:07,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:07,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790961240] [2023-11-29 00:02:07,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:07,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:07,662 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:02:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:07,667 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:02:07,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:07,668 INFO L85 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 1 times [2023-11-29 00:02:07,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:07,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607127477] [2023-11-29 00:02:07,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:07,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:07,686 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:02:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:07,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:02:08,188 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 00:02:08,188 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 00:02:08,189 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 00:02:08,189 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 00:02:08,189 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 00:02:08,189 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:08,189 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 00:02:08,189 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 00:02:08,189 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration7_Lasso [2023-11-29 00:02:08,189 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 00:02:08,189 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 00:02:08,193 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 00:02: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 00:02:08,197 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 00:02: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 00:02: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 00:02:08,204 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 00:02: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 00:02:08,627 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 00:02:08,629 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 00:02:08,631 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 00:02:08,634 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 00:02:08,637 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 00:02:08,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 00:02:08,641 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 00:02:08,644 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 00:02:08,647 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 00:02:09,068 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 00:02:09,068 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 00:02:09,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:09,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:09,070 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:09,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-11-29 00:02:09,075 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 00:02:09,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:09,088 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 00:02:09,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:09,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:09,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:09,089 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 00:02:09,089 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 00:02:09,090 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:09,093 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2023-11-29 00:02:09,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:09,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:09,095 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:09,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2023-11-29 00:02:09,098 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 00:02:09,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:09,113 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 00:02:09,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:09,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:09,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:09,114 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 00:02:09,114 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 00:02:09,116 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:09,119 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2023-11-29 00:02:09,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:09,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:09,121 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:09,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2023-11-29 00:02:09,124 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 00:02:09,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:09,137 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 00:02:09,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:09,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:09,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:09,138 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 00:02:09,138 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 00:02:09,140 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:09,143 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2023-11-29 00:02:09,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:09,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:09,145 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:09,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2023-11-29 00:02:09,148 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 00:02:09,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:09,161 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 00:02:09,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:09,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:09,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:09,162 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 00:02:09,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 00:02:09,164 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:09,168 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2023-11-29 00:02:09,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:09,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:09,169 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:09,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2023-11-29 00:02:09,172 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 00:02:09,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:09,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:09,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:09,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:09,188 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:02:09,188 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:02:09,192 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:09,195 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2023-11-29 00:02:09,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:09,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:09,197 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:09,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2023-11-29 00:02:09,200 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 00:02:09,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:09,213 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 00:02:09,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:09,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:09,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:09,214 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 00:02:09,214 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 00:02:09,216 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:09,219 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2023-11-29 00:02:09,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:09,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:09,220 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:09,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2023-11-29 00:02:09,223 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 00:02:09,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:09,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:09,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:09,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:09,236 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:02:09,237 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:02:09,241 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:09,245 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2023-11-29 00:02:09,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:09,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:09,246 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:09,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2023-11-29 00:02:09,249 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 00:02:09,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:09,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:09,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:09,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:09,276 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:02:09,276 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:02:09,302 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 00:02:09,389 INFO L443 ModelExtractionUtils]: Simplification made 31 calls to the SMT solver. [2023-11-29 00:02:09,389 INFO L444 ModelExtractionUtils]: 5 out of 40 variables were initially zero. Simplification set additionally 29 variables to zero. [2023-11-29 00:02:09,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:09,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:09,390 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:09,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2023-11-29 00:02:09,393 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 00:02:09,404 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2023-11-29 00:02:09,405 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 00:02:09,405 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~i~0#1, v_rep(select #length ULTIMATE.start_main_~numbers~0#1.base)_3, ULTIMATE.start_sort_~pass~0#1) = -2*ULTIMATE.start_sort_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_main_~numbers~0#1.base)_3 - 2*ULTIMATE.start_sort_~pass~0#1 Supporting invariants [-2*ULTIMATE.start_sort_~n#1 + 1*v_rep(select #length ULTIMATE.start_main_~numbers~0#1.base)_3 >= 0] [2023-11-29 00:02:09,408 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2023-11-29 00:02:09,431 INFO L156 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2023-11-29 00:02:09,434 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[~numbers~0!base] could not be translated [2023-11-29 00:02:09,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:09,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:09,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 00:02:09,484 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:02:09,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:09,661 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 00:02:09,662 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:02:09,702 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 00:02:09,703 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2023-11-29 00:02:09,703 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 13 Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:02:09,964 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 13. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 56 states and 77 transitions. Complement of second has 13 states. [2023-11-29 00:02:09,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 7 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-29 00:02:09,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:02:09,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2023-11-29 00:02:09,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 18 transitions. Stem has 11 letters. Loop has 3 letters. [2023-11-29 00:02:09,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 00:02:09,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 18 transitions. Stem has 14 letters. Loop has 3 letters. [2023-11-29 00:02:09,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 00:02:09,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 18 transitions. Stem has 11 letters. Loop has 6 letters. [2023-11-29 00:02:09,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 00:02:09,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 77 transitions. [2023-11-29 00:02:09,969 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2023-11-29 00:02:09,970 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 42 states and 55 transitions. [2023-11-29 00:02:09,970 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2023-11-29 00:02:09,970 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2023-11-29 00:02:09,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 55 transitions. [2023-11-29 00:02:09,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 00:02:09,970 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 55 transitions. [2023-11-29 00:02:09,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 55 transitions. [2023-11-29 00:02:09,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2023-11-29 00:02:09,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 33 states have internal predecessors, (44), 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 00:02:09,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2023-11-29 00:02:09,974 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 44 transitions. [2023-11-29 00:02:09,974 INFO L428 stractBuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2023-11-29 00:02:09,974 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-29 00:02:09,974 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 44 transitions. [2023-11-29 00:02:09,975 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2023-11-29 00:02:09,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:02:09,975 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:02:09,976 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:02:09,976 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-11-29 00:02:09,976 INFO L748 eck$LassoCheckResult]: Stem: 744#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 745#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 739#L558 assume !(main_~array_size~0#1 < 1); 740#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 750#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 751#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 752#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 753#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 757#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 758#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 764#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 763#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 762#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 741#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 742#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 737#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 738#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 743#L550-2 [2023-11-29 00:02:09,976 INFO L750 eck$LassoCheckResult]: Loop: 743#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 746#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 747#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 755#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 756#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 765#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 743#L550-2 [2023-11-29 00:02:09,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:09,977 INFO L85 PathProgramCache]: Analyzing trace with hash 734885288, now seen corresponding path program 1 times [2023-11-29 00:02:09,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:09,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036847031] [2023-11-29 00:02:09,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:09,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:10,138 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2023-11-29 00:02:10,207 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:02:10,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:02:10,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036847031] [2023-11-29 00:02:10,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036847031] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:02:10,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363997606] [2023-11-29 00:02:10,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:10,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:02:10,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:10,209 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:02:10,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2023-11-29 00:02:10,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:10,280 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 00:02:10,282 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:02:10,389 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:02:10,389 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:02:10,477 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:02:10,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363997606] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:02:10,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:02:10,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 14 [2023-11-29 00:02:10,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442934598] [2023-11-29 00:02:10,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:02:10,478 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 00:02:10,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:10,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1946173240, now seen corresponding path program 4 times [2023-11-29 00:02:10,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:10,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970186459] [2023-11-29 00:02:10,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:10,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:10,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:10,486 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:02:10,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:10,492 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:02:10,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:02:10,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 00:02:10,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2023-11-29 00:02:10,609 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. cyclomatic complexity: 15 Second operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 15 states have internal predecessors, (30), 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 00:02:10,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:02:10,789 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2023-11-29 00:02:10,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2023-11-29 00:02:10,790 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2023-11-29 00:02:10,790 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 53 transitions. [2023-11-29 00:02:10,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2023-11-29 00:02:10,791 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2023-11-29 00:02:10,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 53 transitions. [2023-11-29 00:02:10,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 00:02:10,791 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 53 transitions. [2023-11-29 00:02:10,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 53 transitions. [2023-11-29 00:02:10,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2023-11-29 00:02:10,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 36 states have internal predecessors, (48), 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 00:02:10,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2023-11-29 00:02:10,794 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 48 transitions. [2023-11-29 00:02:10,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 00:02:10,796 INFO L428 stractBuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2023-11-29 00:02:10,796 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-29 00:02:10,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 48 transitions. [2023-11-29 00:02:10,797 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2023-11-29 00:02:10,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:02:10,797 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:02:10,797 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:02:10,797 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-29 00:02:10,798 INFO L748 eck$LassoCheckResult]: Stem: 944#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 945#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 940#L558 assume !(main_~array_size~0#1 < 1); 941#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 949#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 950#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 968#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 967#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 965#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 961#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 960#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 948#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 958#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 959#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 957#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 956#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 947#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 937#L551-3 [2023-11-29 00:02:10,798 INFO L750 eck$LassoCheckResult]: Loop: 937#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 942#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 936#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 937#L551-3 [2023-11-29 00:02:10,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:10,798 INFO L85 PathProgramCache]: Analyzing trace with hash 221564791, now seen corresponding path program 1 times [2023-11-29 00:02:10,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:10,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268289003] [2023-11-29 00:02:10,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:10,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:10,908 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:02:10,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:02:10,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268289003] [2023-11-29 00:02:10,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268289003] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:02:10,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141421720] [2023-11-29 00:02:10,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:10,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:02:10,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:10,910 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:02:10,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2023-11-29 00:02:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:10,982 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 00:02:10,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:02:11,053 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:02:11,054 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:02:11,112 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:02:11,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141421720] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:02:11,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:02:11,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-11-29 00:02:11,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998111703] [2023-11-29 00:02:11,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:02:11,113 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 00:02:11,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:11,113 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 2 times [2023-11-29 00:02:11,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:11,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995973794] [2023-11-29 00:02:11,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:11,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:11,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:11,118 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:02:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:11,123 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:02:11,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:02:11,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 00:02:11,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-11-29 00:02:11,213 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. cyclomatic complexity: 16 Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 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 00:02:11,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:02:11,306 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2023-11-29 00:02:11,306 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 43 transitions. [2023-11-29 00:02:11,306 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-11-29 00:02:11,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 27 states and 33 transitions. [2023-11-29 00:02:11,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2023-11-29 00:02:11,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2023-11-29 00:02:11,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 33 transitions. [2023-11-29 00:02:11,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:02:11,308 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 33 transitions. [2023-11-29 00:02:11,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 33 transitions. [2023-11-29 00:02:11,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2023-11-29 00:02:11,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 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 00:02:11,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2023-11-29 00:02:11,311 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 32 transitions. [2023-11-29 00:02:11,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:02:11,312 INFO L428 stractBuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2023-11-29 00:02:11,312 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-11-29 00:02:11,312 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. [2023-11-29 00:02:11,312 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-11-29 00:02:11,313 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:02:11,313 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:02:11,314 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:02:11,314 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-11-29 00:02:11,314 INFO L748 eck$LassoCheckResult]: Stem: 1134#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1135#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 1129#L558 assume !(main_~array_size~0#1 < 1); 1130#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 1138#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1139#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1144#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1148#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1140#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1141#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1145#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1123#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 1124#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1131#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1132#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 1127#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1128#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1133#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 1147#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1146#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 1143#L550-2 [2023-11-29 00:02:11,314 INFO L750 eck$LassoCheckResult]: Loop: 1143#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 1136#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1137#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1142#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 1125#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1126#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 1143#L550-2 [2023-11-29 00:02:11,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:11,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1519410425, now seen corresponding path program 2 times [2023-11-29 00:02:11,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:11,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704808663] [2023-11-29 00:02:11,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:11,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:11,336 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:02:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:11,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:02:11,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:11,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1946173240, now seen corresponding path program 5 times [2023-11-29 00:02:11,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:11,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190818305] [2023-11-29 00:02:11,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:11,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:11,359 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:02:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:11,363 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:02:11,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:11,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1226538048, now seen corresponding path program 1 times [2023-11-29 00:02:11,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:11,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735485226] [2023-11-29 00:02:11,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:11,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:11,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:12,015 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:02:12,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:02:12,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735485226] [2023-11-29 00:02:12,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735485226] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:02:12,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294755982] [2023-11-29 00:02:12,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:12,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:02:12,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:12,018 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:02:12,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2023-11-29 00:02:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:12,095 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-29 00:02:12,097 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:02:12,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:02:12,228 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 26 treesize of output 10 [2023-11-29 00:02:12,240 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 00:02:12,241 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:02:12,361 INFO L349 Elim1Store]: treesize reduction 13, result has 62.9 percent of original size [2023-11-29 00:02:12,361 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 36 treesize of output 30 [2023-11-29 00:02:12,403 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-29 00:02:12,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294755982] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:02:12,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:02:12,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 7] total 19 [2023-11-29 00:02:12,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152763904] [2023-11-29 00:02:12,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:02:12,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:02:12,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 00:02:12,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2023-11-29 00:02:12,532 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. cyclomatic complexity: 9 Second operand has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 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 00:02:12,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:02:12,777 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2023-11-29 00:02:12,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 59 transitions. [2023-11-29 00:02:12,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2023-11-29 00:02:12,780 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 59 transitions. [2023-11-29 00:02:12,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2023-11-29 00:02:12,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2023-11-29 00:02:12,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 59 transitions. [2023-11-29 00:02:12,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:02:12,780 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 59 transitions. [2023-11-29 00:02:12,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 59 transitions. [2023-11-29 00:02:12,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2023-11-29 00:02:12,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 36 states have internal predecessors, (48), 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 00:02:12,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2023-11-29 00:02:12,785 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 48 transitions. [2023-11-29 00:02:12,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 00:02:12,786 INFO L428 stractBuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2023-11-29 00:02:12,786 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-11-29 00:02:12,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 48 transitions. [2023-11-29 00:02:12,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2023-11-29 00:02:12,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:02:12,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:02:12,787 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:02:12,787 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1] [2023-11-29 00:02:12,787 INFO L748 eck$LassoCheckResult]: Stem: 1397#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1398#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 1391#L558 assume !(main_~array_size~0#1 < 1); 1392#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 1401#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1402#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1403#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1404#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1410#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1409#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1408#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1385#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 1386#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1414#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1413#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 1412#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1395#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1396#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 1406#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1419#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 1416#L550-2 [2023-11-29 00:02:12,787 INFO L750 eck$LassoCheckResult]: Loop: 1416#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 1415#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1393#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1394#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 1387#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1388#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1411#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 1421#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1417#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 1416#L550-2 [2023-11-29 00:02:12,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:12,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1519408503, now seen corresponding path program 1 times [2023-11-29 00:02:12,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:12,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643535947] [2023-11-29 00:02:12,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:12,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:12,805 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:02:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:12,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:02:12,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:12,821 INFO L85 PathProgramCache]: Analyzing trace with hash -683362729, now seen corresponding path program 6 times [2023-11-29 00:02:12,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:12,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822886200] [2023-11-29 00:02:12,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:12,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:12,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:12,829 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:02:12,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:12,835 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:02:12,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:12,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1528702369, now seen corresponding path program 2 times [2023-11-29 00:02:12,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:12,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204477232] [2023-11-29 00:02:12,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:12,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:12,994 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 00:02:12,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:02:12,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204477232] [2023-11-29 00:02:12,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204477232] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:02:12,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675259110] [2023-11-29 00:02:12,994 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:02:12,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:02:12,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:12,999 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:02:13,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2023-11-29 00:02:13,089 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:02:13,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:02:13,090 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 00:02:13,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:02:13,235 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 00:02:13,235 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:02:13,339 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 13 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 00:02:13,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675259110] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:02:13,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:02:13,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2023-11-29 00:02:13,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402211824] [2023-11-29 00:02:13,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:02:13,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:02:13,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 00:02:13,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2023-11-29 00:02:13,603 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. cyclomatic complexity: 15 Second operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:02:13,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:02:13,777 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2023-11-29 00:02:13,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 82 transitions. [2023-11-29 00:02:13,778 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2023-11-29 00:02:13,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 64 states and 82 transitions. [2023-11-29 00:02:13,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2023-11-29 00:02:13,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2023-11-29 00:02:13,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 82 transitions. [2023-11-29 00:02:13,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:02:13,780 INFO L218 hiAutomatonCegarLoop]: Abstraction has 64 states and 82 transitions. [2023-11-29 00:02:13,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 82 transitions. [2023-11-29 00:02:13,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2023-11-29 00:02:13,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 60 states have internal predecessors, (79), 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 00:02:13,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 79 transitions. [2023-11-29 00:02:13,786 INFO L240 hiAutomatonCegarLoop]: Abstraction has 61 states and 79 transitions. [2023-11-29 00:02:13,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 00:02:13,788 INFO L428 stractBuchiCegarLoop]: Abstraction has 61 states and 79 transitions. [2023-11-29 00:02:13,788 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-11-29 00:02:13,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 79 transitions. [2023-11-29 00:02:13,789 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2023-11-29 00:02:13,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:02:13,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:02:13,790 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:02:13,790 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-11-29 00:02:13,790 INFO L748 eck$LassoCheckResult]: Stem: 1700#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1701#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 1695#L558 assume !(main_~array_size~0#1 < 1); 1696#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 1703#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1704#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1705#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1706#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1712#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1715#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1713#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1689#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 1690#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1726#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1711#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 1693#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1694#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1699#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 1741#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1718#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 1717#L550-2 [2023-11-29 00:02:13,790 INFO L750 eck$LassoCheckResult]: Loop: 1717#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 1723#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1719#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1720#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 1691#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1692#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 1717#L550-2 [2023-11-29 00:02:13,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:13,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1519410425, now seen corresponding path program 3 times [2023-11-29 00:02:13,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:13,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740775183] [2023-11-29 00:02:13,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:13,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:13,805 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:02:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:13,817 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:02:13,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:13,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1946171318, now seen corresponding path program 1 times [2023-11-29 00:02:13,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:13,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101541031] [2023-11-29 00:02:13,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:13,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:13,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:13,823 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:02:13,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:13,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:02:13,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:13,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1226536126, now seen corresponding path program 2 times [2023-11-29 00:02:13,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:13,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248578555] [2023-11-29 00:02:13,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:13,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:13,840 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:02:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:13,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:02:14,810 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 00:02:14,810 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 00:02:14,810 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 00:02:14,810 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 00:02:14,810 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 00:02:14,810 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:14,810 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 00:02:14,810 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 00:02:14,810 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration12_Lasso [2023-11-29 00:02:14,811 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 00:02:14,811 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 00:02:14,813 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 00:02:14,815 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 00:02:14,816 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 00:02:14,819 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 00:02:14,820 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 00:02:14,822 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 00:02:14,823 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 00:02:14,826 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 00:02:14,828 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 00:02:14,829 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 00:02:14,831 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 00:02:14,833 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 00:02:14,835 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 00:02:15,296 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 00:02:15,299 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 00:02:15,300 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 00:02:15,302 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 00:02:15,590 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 00:02:15,590 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 00:02:15,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:15,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:15,595 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:15,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2023-11-29 00:02:15,597 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 00:02:15,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:15,611 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 00:02:15,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:15,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:15,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:15,611 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 00:02:15,612 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 00:02:15,613 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:15,616 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2023-11-29 00:02:15,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:15,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:15,617 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:15,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2023-11-29 00:02:15,620 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 00:02:15,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:15,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 00:02:15,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:15,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:15,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:15,633 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 00:02:15,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 00:02:15,634 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:15,637 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2023-11-29 00:02:15,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:15,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:15,638 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:15,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2023-11-29 00:02:15,641 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 00:02:15,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:15,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:15,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:15,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:15,654 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:02:15,654 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:02:15,658 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:15,661 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2023-11-29 00:02:15,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:15,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:15,662 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:15,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2023-11-29 00:02:15,665 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 00:02:15,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:15,677 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 00:02:15,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:15,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:15,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:15,677 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 00:02:15,677 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 00:02:15,679 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:15,682 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2023-11-29 00:02:15,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:15,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:15,683 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:15,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2023-11-29 00:02:15,686 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 00:02:15,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:15,698 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 00:02:15,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:15,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:15,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:15,699 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 00:02:15,699 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 00:02:15,701 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:15,703 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2023-11-29 00:02:15,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:15,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:15,705 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:15,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2023-11-29 00:02:15,707 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 00:02:15,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:15,719 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 00:02:15,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:15,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:15,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:15,720 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 00:02:15,720 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 00:02:15,721 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:15,724 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2023-11-29 00:02:15,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:15,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:15,725 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:15,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2023-11-29 00:02:15,727 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 00:02:15,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:15,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:15,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:15,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:15,740 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:02:15,741 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:02:15,744 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:15,746 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2023-11-29 00:02:15,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:15,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:15,747 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:15,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2023-11-29 00:02:15,750 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 00:02:15,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:15,761 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 00:02:15,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:15,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:15,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:15,761 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 00:02:15,761 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 00:02:15,763 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:15,765 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2023-11-29 00:02:15,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:15,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:15,766 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:15,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2023-11-29 00:02:15,769 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 00:02:15,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:15,780 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 00:02:15,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:15,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:15,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:15,781 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 00:02:15,781 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 00:02:15,782 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:15,786 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2023-11-29 00:02:15,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:15,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:15,787 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:15,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2023-11-29 00:02:15,790 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 00:02:15,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:15,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 00:02:15,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:15,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:15,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:15,802 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 00:02:15,802 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 00:02:15,804 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:15,807 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2023-11-29 00:02:15,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:15,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:15,808 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:15,809 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2023-11-29 00:02:15,811 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 00:02:15,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:15,822 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 00:02:15,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:15,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:15,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:15,823 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 00:02:15,823 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 00:02:15,825 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:15,827 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2023-11-29 00:02:15,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:15,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:15,829 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:15,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2023-11-29 00:02:15,831 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 00:02:15,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:15,842 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 00:02:15,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:15,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:15,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:15,843 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 00:02:15,843 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 00:02:15,845 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:15,847 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2023-11-29 00:02:15,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:15,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:15,848 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:15,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2023-11-29 00:02:15,851 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 00:02:15,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:15,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:15,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:15,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:15,866 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:02:15,866 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:02:15,873 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:15,877 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2023-11-29 00:02:15,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:15,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:15,878 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:15,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2023-11-29 00:02:15,880 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 00:02:15,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:15,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:15,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:15,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:15,893 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:02:15,893 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:02:15,897 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:15,900 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2023-11-29 00:02:15,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:15,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:15,901 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:15,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2023-11-29 00:02:15,904 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 00:02:15,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:15,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:15,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:15,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:15,917 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:02:15,917 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:02:15,920 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:15,923 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2023-11-29 00:02:15,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:15,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:15,924 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:15,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2023-11-29 00:02:15,927 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 00:02:15,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:15,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:15,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:15,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:15,940 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:02:15,940 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:02:15,945 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:15,947 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2023-11-29 00:02:15,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:15,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:15,948 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:15,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2023-11-29 00:02:15,951 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 00:02:15,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:15,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:15,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:15,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:15,964 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:02:15,964 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:02:15,968 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:15,971 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2023-11-29 00:02:15,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:15,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:15,972 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:15,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2023-11-29 00:02:15,974 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 00:02:15,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:15,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:15,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:15,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:15,989 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:02:15,989 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:02:15,997 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 00:02:16,012 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2023-11-29 00:02:16,012 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-11-29 00:02:16,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:16,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:16,013 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:16,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2023-11-29 00:02:16,020 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 00:02:16,032 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2023-11-29 00:02:16,033 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 00:02:16,033 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~pass~0#1) = -2*ULTIMATE.start_sort_~pass~0#1 + 3 Supporting invariants [-1*ULTIMATE.start_sort_~n#1 + 3 >= 0] [2023-11-29 00:02:16,035 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2023-11-29 00:02:16,070 INFO L156 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2023-11-29 00:02:16,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:16,114 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 00:02:16,115 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:02:16,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:16,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 00:02:16,250 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:02:16,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:02:16,296 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 3 loop predicates [2023-11-29 00:02:16,296 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 79 transitions. cyclomatic complexity: 25 Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 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 00:02:16,405 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2023-11-29 00:02:16,476 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 79 transitions. cyclomatic complexity: 25. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 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) Result 75 states and 95 transitions. Complement of second has 14 states. [2023-11-29 00:02:16,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 7 stem states 2 non-accepting loop states 2 accepting loop states [2023-11-29 00:02:16,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 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 00:02:16,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 38 transitions. [2023-11-29 00:02:16,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 38 transitions. Stem has 20 letters. Loop has 6 letters. [2023-11-29 00:02:16,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 00:02:16,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 38 transitions. Stem has 26 letters. Loop has 6 letters. [2023-11-29 00:02:16,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 00:02:16,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 38 transitions. Stem has 20 letters. Loop has 12 letters. [2023-11-29 00:02:16,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 00:02:16,483 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 95 transitions. [2023-11-29 00:02:16,484 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2023-11-29 00:02:16,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 44 states and 55 transitions. [2023-11-29 00:02:16,485 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2023-11-29 00:02:16,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2023-11-29 00:02:16,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 55 transitions. [2023-11-29 00:02:16,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:02:16,486 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44 states and 55 transitions. [2023-11-29 00:02:16,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 55 transitions. [2023-11-29 00:02:16,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2023-11-29 00:02:16,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 38 states have internal predecessors, (50), 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 00:02:16,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2023-11-29 00:02:16,490 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 50 transitions. [2023-11-29 00:02:16,490 INFO L428 stractBuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2023-11-29 00:02:16,490 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-11-29 00:02:16,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 50 transitions. [2023-11-29 00:02:16,491 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2023-11-29 00:02:16,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:02:16,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:02:16,492 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:02:16,492 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1] [2023-11-29 00:02:16,492 INFO L748 eck$LassoCheckResult]: Stem: 2015#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2016#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 2009#L558 assume !(main_~array_size~0#1 < 1); 2010#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 2018#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 2019#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2020#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 2021#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2024#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 2028#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2027#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 2026#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2025#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2003#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 2004#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 2029#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2030#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 2041#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 2040#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2035#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 2007#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 2008#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 2013#L550-2 [2023-11-29 00:02:16,493 INFO L750 eck$LassoCheckResult]: Loop: 2013#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 2017#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 2011#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2012#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 2023#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 2036#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2037#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 2005#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 2006#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 2013#L550-2 [2023-11-29 00:02:16,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:16,493 INFO L85 PathProgramCache]: Analyzing trace with hash 2059791961, now seen corresponding path program 2 times [2023-11-29 00:02:16,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:16,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090807309] [2023-11-29 00:02:16,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:16,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:16,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:16,704 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:02:16,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:02:16,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090807309] [2023-11-29 00:02:16,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090807309] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:02:16,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774203066] [2023-11-29 00:02:16,704 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:02:16,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:02:16,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:16,706 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:02:16,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2023-11-29 00:02:16,792 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:02:16,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:02:16,793 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 00:02:16,794 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:02:16,898 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:02:16,898 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:02:16,991 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:02:16,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774203066] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:02:16,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:02:16,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2023-11-29 00:02:16,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122942694] [2023-11-29 00:02:16,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:02:16,992 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 00:02:16,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:16,993 INFO L85 PathProgramCache]: Analyzing trace with hash -683362729, now seen corresponding path program 7 times [2023-11-29 00:02:16,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:16,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545085024] [2023-11-29 00:02:16,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:16,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:17,000 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:02:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:17,006 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:02:17,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:02:17,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 00:02:17,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2023-11-29 00:02:17,210 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. cyclomatic complexity: 15 Second operand has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 20 states have internal predecessors, (43), 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 00:02:17,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:02:17,411 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2023-11-29 00:02:17,411 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 64 transitions. [2023-11-29 00:02:17,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2023-11-29 00:02:17,412 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 64 transitions. [2023-11-29 00:02:17,412 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2023-11-29 00:02:17,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2023-11-29 00:02:17,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 64 transitions. [2023-11-29 00:02:17,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:02:17,413 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 64 transitions. [2023-11-29 00:02:17,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 64 transitions. [2023-11-29 00:02:17,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2023-11-29 00:02:17,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 43 states have internal predecessors, (56), 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 00:02:17,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2023-11-29 00:02:17,417 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 56 transitions. [2023-11-29 00:02:17,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 00:02:17,418 INFO L428 stractBuchiCegarLoop]: Abstraction has 44 states and 56 transitions. [2023-11-29 00:02:17,418 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2023-11-29 00:02:17,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 56 transitions. [2023-11-29 00:02:17,419 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2023-11-29 00:02:17,419 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:02:17,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:02:17,420 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:02:17,420 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1] [2023-11-29 00:02:17,420 INFO L748 eck$LassoCheckResult]: Stem: 2263#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2264#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 2261#L558 assume !(main_~array_size~0#1 < 1); 2262#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 2268#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 2269#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2270#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 2271#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2281#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 2280#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2279#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 2278#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2277#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2255#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 2256#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 2265#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2266#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 2297#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 2296#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2273#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 2274#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 2298#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2288#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 2290#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 2287#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 2275#L550-2 [2023-11-29 00:02:17,420 INFO L750 eck$LassoCheckResult]: Loop: 2275#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 2276#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 2293#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2291#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 2257#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 2258#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 2292#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 2283#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 2289#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 2275#L550-2 [2023-11-29 00:02:17,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:17,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1064655528, now seen corresponding path program 3 times [2023-11-29 00:02:17,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:17,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566661914] [2023-11-29 00:02:17,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:17,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:17,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:17,442 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:02:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:17,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:02:17,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:17,461 INFO L85 PathProgramCache]: Analyzing trace with hash -683362729, now seen corresponding path program 8 times [2023-11-29 00:02:17,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:17,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839205015] [2023-11-29 00:02:17,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:17,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:17,469 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:02:17,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:17,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:02:17,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:17,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1495099280, now seen corresponding path program 3 times [2023-11-29 00:02:17,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:17,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513809776] [2023-11-29 00:02:17,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:17,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:19,022 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 10 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:02:19,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:02:19,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513809776] [2023-11-29 00:02:19,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513809776] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:02:19,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155980380] [2023-11-29 00:02:19,023 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 00:02:19,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:02:19,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:19,025 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:02:19,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2023-11-29 00:02:19,158 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-11-29 00:02:19,158 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:02:19,160 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-29 00:02:19,163 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:02:19,461 INFO L349 Elim1Store]: treesize reduction 58, result has 52.8 percent of original size [2023-11-29 00:02:19,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 46 treesize of output 88 [2023-11-29 00:02:20,540 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:02:20,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 88 treesize of output 62 [2023-11-29 00:02:20,754 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:02:20,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 22 [2023-11-29 00:02:20,888 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 00:02:20,888 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:02:21,650 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 128 treesize of output 112 [2023-11-29 00:02:21,706 INFO L349 Elim1Store]: treesize reduction 68, result has 42.9 percent of original size [2023-11-29 00:02:21,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 878 treesize of output 587 [2023-11-29 00:02:21,788 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 00:02:21,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155980380] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:02:21,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:02:21,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 16] total 56 [2023-11-29 00:02:21,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772399858] [2023-11-29 00:02:21,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:02:22,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:02:22,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-11-29 00:02:22,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=2731, Unknown=0, NotChecked=0, Total=3080 [2023-11-29 00:02:22,029 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. cyclomatic complexity: 16 Second operand has 56 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 56 states have internal predecessors, (86), 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 00:02:32,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:02:32,014 INFO L93 Difference]: Finished difference Result 205 states and 276 transitions. [2023-11-29 00:02:32,014 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 205 states and 276 transitions. [2023-11-29 00:02:32,017 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 75 [2023-11-29 00:02:32,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 205 states to 205 states and 276 transitions. [2023-11-29 00:02:32,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2023-11-29 00:02:32,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155 [2023-11-29 00:02:32,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 205 states and 276 transitions. [2023-11-29 00:02:32,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:02:32,021 INFO L218 hiAutomatonCegarLoop]: Abstraction has 205 states and 276 transitions. [2023-11-29 00:02:32,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states and 276 transitions. [2023-11-29 00:02:32,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 99. [2023-11-29 00:02:32,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 99 states have (on average 1.3737373737373737) internal successors, (136), 98 states have internal predecessors, (136), 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 00:02:32,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 136 transitions. [2023-11-29 00:02:32,031 INFO L240 hiAutomatonCegarLoop]: Abstraction has 99 states and 136 transitions. [2023-11-29 00:02:32,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2023-11-29 00:02:32,031 INFO L428 stractBuchiCegarLoop]: Abstraction has 99 states and 136 transitions. [2023-11-29 00:02:32,031 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2023-11-29 00:02:32,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 136 transitions. [2023-11-29 00:02:32,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2023-11-29 00:02:32,032 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:02:32,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:02:32,034 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:02:32,034 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1] [2023-11-29 00:02:32,034 INFO L748 eck$LassoCheckResult]: Stem: 3028#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3029#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 3022#L558 assume !(main_~array_size~0#1 < 1); 3023#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 3030#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 3033#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3034#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 3035#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3040#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 3044#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3043#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 3042#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3041#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 3016#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 3017#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 3045#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 3046#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 3055#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 3056#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 3051#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 3050#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 3026#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 3027#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 3038#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 3048#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 3049#L550-2 [2023-11-29 00:02:32,034 INFO L750 eck$LassoCheckResult]: Loop: 3049#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 3111#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 3109#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 3105#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 3018#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 3019#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 3047#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 3083#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 3114#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 3049#L550-2 [2023-11-29 00:02:32,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:32,035 INFO L85 PathProgramCache]: Analyzing trace with hash 384595236, now seen corresponding path program 1 times [2023-11-29 00:02:32,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:32,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104068300] [2023-11-29 00:02:32,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:32,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:32,061 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:02:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:32,081 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:02:32,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:32,082 INFO L85 PathProgramCache]: Analyzing trace with hash -683362729, now seen corresponding path program 9 times [2023-11-29 00:02:32,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:32,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838510228] [2023-11-29 00:02:32,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:32,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:32,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:32,091 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:02:32,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:32,096 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:02:32,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:32,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1063888748, now seen corresponding path program 3 times [2023-11-29 00:02:32,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:32,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336168867] [2023-11-29 00:02:32,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:32,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:32,125 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:02:32,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:32,150 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:02:36,254 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 00:02:36,254 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 00:02:36,255 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 00:02:36,255 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 00:02:36,255 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 00:02:36,255 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:36,255 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 00:02:36,255 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 00:02:36,255 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration15_Lasso [2023-11-29 00:02:36,255 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 00:02:36,255 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 00:02:36,258 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 00:02:36,260 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 00:02:36,263 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 00:02:36,265 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 00:02:36,267 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 00:02:36,269 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 00:02:36,270 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 00:02:36,885 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 00:02:36,887 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 00:02:36,888 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 00:02:36,890 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 00:02:36,891 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 00:02:36,892 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 00:02:36,894 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 00:02:36,895 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 00:02:36,897 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 00:02:36,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 00:02:36,900 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 00:02:37,376 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 00:02:37,376 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 00:02:37,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:37,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:37,377 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:37,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2023-11-29 00:02:37,379 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 00:02:37,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:37,390 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 00:02:37,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:37,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:37,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:37,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 00:02:37,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 00:02:37,392 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:37,394 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2023-11-29 00:02:37,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:37,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:37,395 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:37,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2023-11-29 00:02:37,397 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 00:02:37,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:37,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:37,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:37,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:37,410 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:02:37,410 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:02:37,416 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:37,418 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2023-11-29 00:02:37,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:37,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:37,419 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:37,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2023-11-29 00:02:37,422 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 00:02:37,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:37,433 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 00:02:37,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:37,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:37,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:37,434 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 00:02:37,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 00:02:37,436 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:37,438 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2023-11-29 00:02:37,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:37,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:37,439 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:37,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2023-11-29 00:02:37,442 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 00:02:37,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:37,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 00:02:37,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:37,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:37,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:37,454 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 00:02:37,454 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 00:02:37,456 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:37,458 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2023-11-29 00:02:37,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:37,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:37,460 INFO L229 MonitoredProcess]: Starting monitored process 68 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:37,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2023-11-29 00:02:37,462 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 00:02:37,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:37,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:37,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:37,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:37,475 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:02:37,475 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:02:37,479 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:37,482 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2023-11-29 00:02:37,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:37,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:37,483 INFO L229 MonitoredProcess]: Starting monitored process 69 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:37,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2023-11-29 00:02:37,486 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 00:02:37,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:37,497 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 00:02:37,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:37,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:37,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:37,498 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 00:02:37,498 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 00:02:37,499 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:02:37,501 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2023-11-29 00:02:37,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:37,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:37,503 INFO L229 MonitoredProcess]: Starting monitored process 70 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:37,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2023-11-29 00:02:37,505 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 00:02:37,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:02:37,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:02:37,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:02:37,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:02:37,528 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:02:37,528 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:02:37,549 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 00:02:37,594 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2023-11-29 00:02:37,594 INFO L444 ModelExtractionUtils]: 4 out of 28 variables were initially zero. Simplification set additionally 19 variables to zero. [2023-11-29 00:02:37,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:02:37,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:37,596 INFO L229 MonitoredProcess]: Starting monitored process 71 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:37,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2023-11-29 00:02:37,598 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 00:02:37,609 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2023-11-29 00:02:37,610 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 00:02:37,610 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~numbers~0#1.base) (+ (- 4) ULTIMATE.start_main_~numbers~0#1.offset (* ULTIMATE.start_main_~array_size~0#1 4)))_1, v_rep(select (select #memory_int#0 ULTIMATE.start_sort_~x#1.base) (+ 8 ULTIMATE.start_sort_~x#1.offset))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~numbers~0#1.base) (+ (- 4) ULTIMATE.start_main_~numbers~0#1.offset (* ULTIMATE.start_main_~array_size~0#1 4)))_1 - 1*v_rep(select (select #memory_int#0 ULTIMATE.start_sort_~x#1.base) (+ 8 ULTIMATE.start_sort_~x#1.offset))_1 Supporting invariants [1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~numbers~0#1.base) (+ (- 4) ULTIMATE.start_main_~numbers~0#1.offset (* ULTIMATE.start_main_~array_size~0#1 4)))_1 - 1*v_rep(select (select #memory_int#0 ULTIMATE.start_sort_~x#1.base) ULTIMATE.start_sort_~x#1.offset)_3 >= 0] [2023-11-29 00:02:37,613 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2023-11-29 00:02:37,708 INFO L156 tatePredicateManager]: 18 out of 19 supporting invariants were superfluous and have been removed [2023-11-29 00:02:37,711 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#0[~x!base][8 + ~x!offset] could not be translated [2023-11-29 00:02:37,711 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#0[~numbers~0!base][-4 + ~numbers~0!offset + ~array_size~0 * 4] could not be translated [2023-11-29 00:02:37,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:37,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:37,774 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-29 00:02:37,776 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:02:37,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:02:37,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 42 treesize of output 22 [2023-11-29 00:02:38,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:02:38,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:02:38,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 31 [2023-11-29 00:02:38,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:02:38,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:02:38,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 31 [2023-11-29 00:02:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:38,290 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 00:02:38,291 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:02:38,449 INFO L349 Elim1Store]: treesize reduction 101, result has 37.3 percent of original size [2023-11-29 00:02:38,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 78 treesize of output 98 [2023-11-29 00:02:38,784 INFO L349 Elim1Store]: treesize reduction 133, result has 17.4 percent of original size [2023-11-29 00:02:38,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 133 treesize of output 91 [2023-11-29 00:02:38,869 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2023-11-29 00:02:38,925 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:02:38,926 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.16 stem predicates 7 loop predicates [2023-11-29 00:02:38,926 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 99 states and 136 transitions. cyclomatic complexity: 42 Second operand has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:02:39,580 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 99 states and 136 transitions. cyclomatic complexity: 42. Second operand has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 243 states and 333 transitions. Complement of second has 33 states. [2023-11-29 00:02:39,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 25 states 16 stem states 7 non-accepting loop states 2 accepting loop states [2023-11-29 00:02:39,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:02:39,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 73 transitions. [2023-11-29 00:02:39,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 73 transitions. Stem has 25 letters. Loop has 9 letters. [2023-11-29 00:02:39,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 00:02:39,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 73 transitions. Stem has 34 letters. Loop has 9 letters. [2023-11-29 00:02:39,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 00:02:39,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 73 transitions. Stem has 25 letters. Loop has 18 letters. [2023-11-29 00:02:39,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 00:02:39,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 243 states and 333 transitions. [2023-11-29 00:02:39,586 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 51 [2023-11-29 00:02:39,588 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 243 states to 230 states and 313 transitions. [2023-11-29 00:02:39,588 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2023-11-29 00:02:39,589 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 110 [2023-11-29 00:02:39,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 230 states and 313 transitions. [2023-11-29 00:02:39,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 00:02:39,589 INFO L218 hiAutomatonCegarLoop]: Abstraction has 230 states and 313 transitions. [2023-11-29 00:02:39,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states and 313 transitions. [2023-11-29 00:02:39,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 163. [2023-11-29 00:02:39,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 163 states have (on average 1.3558282208588956) internal successors, (221), 162 states have internal predecessors, (221), 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 00:02:39,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 221 transitions. [2023-11-29 00:02:39,597 INFO L240 hiAutomatonCegarLoop]: Abstraction has 163 states and 221 transitions. [2023-11-29 00:02:39,597 INFO L428 stractBuchiCegarLoop]: Abstraction has 163 states and 221 transitions. [2023-11-29 00:02:39,597 INFO L335 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2023-11-29 00:02:39,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 163 states and 221 transitions. [2023-11-29 00:02:39,598 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 40 [2023-11-29 00:02:39,598 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:02:39,598 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:02:39,599 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:02:39,599 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1] [2023-11-29 00:02:39,600 INFO L748 eck$LassoCheckResult]: Stem: 3647#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3648#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 3641#L558 assume !(main_~array_size~0#1 < 1); 3642#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 3653#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 3654#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3655#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 3656#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3663#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 3673#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3671#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 3672#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3664#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 3666#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 3689#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 3688#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 3686#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 3685#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 3684#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 3682#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 3683#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 3772#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 3767#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 3764#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 3762#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 3659#L550-2 [2023-11-29 00:02:39,600 INFO L750 eck$LassoCheckResult]: Loop: 3659#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 3660#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 3796#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 3791#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 3637#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 3638#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 3790#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 3747#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 3717#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 3659#L550-2 [2023-11-29 00:02:39,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:39,600 INFO L85 PathProgramCache]: Analyzing trace with hash 441853538, now seen corresponding path program 4 times [2023-11-29 00:02:39,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:39,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905363855] [2023-11-29 00:02:39,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:39,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:39,619 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:02:39,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:39,635 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:02:39,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:39,636 INFO L85 PathProgramCache]: Analyzing trace with hash -683362729, now seen corresponding path program 10 times [2023-11-29 00:02:39,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:39,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270221163] [2023-11-29 00:02:39,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:39,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:39,643 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:02:39,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:39,648 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:02:39,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:39,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1951214870, now seen corresponding path program 4 times [2023-11-29 00:02:39,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:39,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352086226] [2023-11-29 00:02:39,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:39,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:40,922 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 21 proven. 35 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 00:02:40,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:02:40,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352086226] [2023-11-29 00:02:40,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352086226] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:02:40,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269772396] [2023-11-29 00:02:40,923 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 00:02:40,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:02:40,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:40,924 INFO L229 MonitoredProcess]: Starting monitored process 72 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:02:40,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2023-11-29 00:02:41,025 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 00:02:41,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:02:41,027 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 00:02:41,032 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:02:41,088 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:02:41,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 42 treesize of output 22 [2023-11-29 00:02:41,214 INFO L349 Elim1Store]: treesize reduction 112, result has 13.2 percent of original size [2023-11-29 00:02:41,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 56 treesize of output 45 [2023-11-29 00:02:41,248 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:02:41,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 32 treesize of output 12 [2023-11-29 00:02:41,264 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 23 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 00:02:41,264 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:02:41,864 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 294 treesize of output 254 [2023-11-29 00:02:41,985 INFO L349 Elim1Store]: treesize reduction 52, result has 50.5 percent of original size [2023-11-29 00:02:41,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 4528648 treesize of output 2959663 [2023-11-29 00:02:42,649 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 23 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 00:02:42,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269772396] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:02:42,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:02:42,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9, 10] total 33 [2023-11-29 00:02:42,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106599017] [2023-11-29 00:02:42,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:02:42,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:02:42,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-29 00:02:42,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=913, Unknown=0, NotChecked=0, Total=1056 [2023-11-29 00:02:42,856 INFO L87 Difference]: Start difference. First operand 163 states and 221 transitions. cyclomatic complexity: 67 Second operand has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 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 00:02:45,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:02:45,526 INFO L93 Difference]: Finished difference Result 270 states and 359 transitions. [2023-11-29 00:02:45,526 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 270 states and 359 transitions. [2023-11-29 00:02:45,527 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 140 [2023-11-29 00:02:45,529 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 270 states to 270 states and 359 transitions. [2023-11-29 00:02:45,529 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 177 [2023-11-29 00:02:45,529 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 177 [2023-11-29 00:02:45,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 270 states and 359 transitions. [2023-11-29 00:02:45,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 00:02:45,530 INFO L218 hiAutomatonCegarLoop]: Abstraction has 270 states and 359 transitions. [2023-11-29 00:02:45,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states and 359 transitions. [2023-11-29 00:02:45,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 164. [2023-11-29 00:02:45,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 164 states have (on average 1.3475609756097562) internal successors, (221), 163 states have internal predecessors, (221), 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 00:02:45,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 221 transitions. [2023-11-29 00:02:45,536 INFO L240 hiAutomatonCegarLoop]: Abstraction has 164 states and 221 transitions. [2023-11-29 00:02:45,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-11-29 00:02:45,537 INFO L428 stractBuchiCegarLoop]: Abstraction has 164 states and 221 transitions. [2023-11-29 00:02:45,538 INFO L335 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2023-11-29 00:02:45,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 164 states and 221 transitions. [2023-11-29 00:02:45,539 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 63 [2023-11-29 00:02:45,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:02:45,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:02:45,539 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:02:45,539 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-11-29 00:02:45,540 INFO L748 eck$LassoCheckResult]: Stem: 4375#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4376#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 4369#L558 assume !(main_~array_size~0#1 < 1); 4370#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 4380#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 4381#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 4382#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 4383#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 4390#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 4397#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 4395#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 4396#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 4391#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 4393#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 4418#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 4417#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 4415#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 4414#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 4413#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 4411#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 4412#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 4451#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 4385#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 4386#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 4450#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 4448#L550-2 [2023-11-29 00:02:45,540 INFO L750 eck$LassoCheckResult]: Loop: 4448#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 4518#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 4517#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 4480#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 4479#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 4478#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 4448#L550-2 [2023-11-29 00:02:45,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:45,540 INFO L85 PathProgramCache]: Analyzing trace with hash 441855460, now seen corresponding path program 5 times [2023-11-29 00:02:45,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:45,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504020133] [2023-11-29 00:02:45,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:45,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:45,570 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:02:45,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:45,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:02:45,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:45,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1946171318, now seen corresponding path program 2 times [2023-11-29 00:02:45,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:45,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094854659] [2023-11-29 00:02:45,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:45,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:45,584 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:02:45,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:45,587 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:02:45,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:45,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1852227565, now seen corresponding path program 5 times [2023-11-29 00:02:45,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:45,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625316509] [2023-11-29 00:02:45,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:45,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:45,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:45,733 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 00:02:45,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:02:45,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625316509] [2023-11-29 00:02:45,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625316509] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:02:45,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813595490] [2023-11-29 00:02:45,734 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 00:02:45,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:02:45,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:45,735 INFO L229 MonitoredProcess]: Starting monitored process 73 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:02:45,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2023-11-29 00:02:45,860 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2023-11-29 00:02:45,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:02:45,862 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 00:02:45,863 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:02:45,949 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 00:02:45,949 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:02:46,019 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 00:02:46,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813595490] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:02:46,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:02:46,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 17 [2023-11-29 00:02:46,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385367637] [2023-11-29 00:02:46,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:02:46,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:02:46,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 00:02:46,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2023-11-29 00:02:46,091 INFO L87 Difference]: Start difference. First operand 164 states and 221 transitions. cyclomatic complexity: 67 Second operand has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 18 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:02:46,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:02:46,408 INFO L93 Difference]: Finished difference Result 236 states and 306 transitions. [2023-11-29 00:02:46,408 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 236 states and 306 transitions. [2023-11-29 00:02:46,413 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 115 [2023-11-29 00:02:46,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 236 states to 236 states and 306 transitions. [2023-11-29 00:02:46,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 150 [2023-11-29 00:02:46,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 150 [2023-11-29 00:02:46,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 236 states and 306 transitions. [2023-11-29 00:02:46,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 00:02:46,416 INFO L218 hiAutomatonCegarLoop]: Abstraction has 236 states and 306 transitions. [2023-11-29 00:02:46,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states and 306 transitions. [2023-11-29 00:02:46,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 209. [2023-11-29 00:02:46,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 209 states have (on average 1.30622009569378) internal successors, (273), 208 states have internal predecessors, (273), 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 00:02:46,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 273 transitions. [2023-11-29 00:02:46,423 INFO L240 hiAutomatonCegarLoop]: Abstraction has 209 states and 273 transitions. [2023-11-29 00:02:46,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 00:02:46,424 INFO L428 stractBuchiCegarLoop]: Abstraction has 209 states and 273 transitions. [2023-11-29 00:02:46,424 INFO L335 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2023-11-29 00:02:46,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 209 states and 273 transitions. [2023-11-29 00:02:46,425 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 100 [2023-11-29 00:02:46,425 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:02:46,425 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:02:46,426 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:02:46,426 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 2, 1, 1, 1, 1] [2023-11-29 00:02:46,426 INFO L748 eck$LassoCheckResult]: Stem: 5004#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5005#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 5002#L558 assume !(main_~array_size~0#1 < 1); 5003#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 5010#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 5014#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5015#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 5016#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5026#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 5033#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5031#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 5032#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5027#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 5029#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 5050#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 5049#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 5047#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 5046#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 5045#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 5044#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 5000#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 5001#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 5094#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 5183#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 5092#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 5093#L550-2 [2023-11-29 00:02:46,427 INFO L750 eck$LassoCheckResult]: Loop: 5093#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 5130#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 5123#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 5124#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 5193#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 5191#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 5125#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 5018#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 5190#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 5187#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 5189#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 5186#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 5093#L550-2 [2023-11-29 00:02:46,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:46,427 INFO L85 PathProgramCache]: Analyzing trace with hash 441855460, now seen corresponding path program 6 times [2023-11-29 00:02:46,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:46,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146083653] [2023-11-29 00:02:46,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:46,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:46,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:46,444 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:02:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:46,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:02:46,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:46,459 INFO L85 PathProgramCache]: Analyzing trace with hash 823341480, now seen corresponding path program 1 times [2023-11-29 00:02:46,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:46,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218758962] [2023-11-29 00:02:46,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:46,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:46,466 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:02:46,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:46,472 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:02:46,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:46,473 INFO L85 PathProgramCache]: Analyzing trace with hash 12362507, now seen corresponding path program 6 times [2023-11-29 00:02:46,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:46,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548876005] [2023-11-29 00:02:46,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:46,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:46,698 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 18 proven. 45 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 00:02:46,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:02:46,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548876005] [2023-11-29 00:02:46,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548876005] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:02:46,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404057275] [2023-11-29 00:02:46,699 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-29 00:02:46,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:02:46,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:46,703 INFO L229 MonitoredProcess]: Starting monitored process 74 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:02:46,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2023-11-29 00:02:46,890 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-11-29 00:02:46,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:02:46,892 INFO L262 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 00:02:46,893 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:02:47,082 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 47 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 00:02:47,082 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:02:47,211 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 23 proven. 40 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 00:02:47,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404057275] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:02:47,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:02:47,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2023-11-29 00:02:47,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005921501] [2023-11-29 00:02:47,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:02:47,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:02:47,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-29 00:02:47,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2023-11-29 00:02:47,496 INFO L87 Difference]: Start difference. First operand 209 states and 273 transitions. cyclomatic complexity: 74 Second operand has 21 states, 21 states have (on average 3.0) internal successors, (63), 21 states have internal predecessors, (63), 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 00:02:47,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:02:47,731 INFO L93 Difference]: Finished difference Result 282 states and 358 transitions. [2023-11-29 00:02:47,732 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 282 states and 358 transitions. [2023-11-29 00:02:47,734 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 141 [2023-11-29 00:02:47,736 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 282 states to 282 states and 358 transitions. [2023-11-29 00:02:47,736 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 192 [2023-11-29 00:02:47,737 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 192 [2023-11-29 00:02:47,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 282 states and 358 transitions. [2023-11-29 00:02:47,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 00:02:47,737 INFO L218 hiAutomatonCegarLoop]: Abstraction has 282 states and 358 transitions. [2023-11-29 00:02:47,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states and 358 transitions. [2023-11-29 00:02:47,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 232. [2023-11-29 00:02:47,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 232 states have (on average 1.2844827586206897) internal successors, (298), 231 states have internal predecessors, (298), 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 00:02:47,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 298 transitions. [2023-11-29 00:02:47,745 INFO L240 hiAutomatonCegarLoop]: Abstraction has 232 states and 298 transitions. [2023-11-29 00:02:47,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 00:02:47,746 INFO L428 stractBuchiCegarLoop]: Abstraction has 232 states and 298 transitions. [2023-11-29 00:02:47,746 INFO L335 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2023-11-29 00:02:47,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 232 states and 298 transitions. [2023-11-29 00:02:47,747 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 112 [2023-11-29 00:02:47,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:02:47,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:02:47,748 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:02:47,748 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1] [2023-11-29 00:02:47,748 INFO L748 eck$LassoCheckResult]: Stem: 5756#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5757#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 5751#L558 assume !(main_~array_size~0#1 < 1); 5752#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 5762#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 5763#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5764#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 5765#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5774#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 5802#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5801#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 5800#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5775#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 5776#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5781#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 5745#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 5746#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 5815#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 5816#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 5827#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 5823#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 5824#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 5772#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 5921#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 5920#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 5919#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 5915#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 5887#L550-2 [2023-11-29 00:02:47,749 INFO L750 eck$LassoCheckResult]: Loop: 5887#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 5888#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 5864#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 5865#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 5910#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 5907#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 5904#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 5902#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 5899#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 5844#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 5847#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 5892#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 5887#L550-2 [2023-11-29 00:02:47,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:47,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1306715774, now seen corresponding path program 2 times [2023-11-29 00:02:47,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:47,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680298621] [2023-11-29 00:02:47,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:47,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:47,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:47,990 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:02:47,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:02:47,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680298621] [2023-11-29 00:02:47,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680298621] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:02:47,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725633216] [2023-11-29 00:02:47,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:02:47,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:02:47,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:47,994 INFO L229 MonitoredProcess]: Starting monitored process 75 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:02:47,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2023-11-29 00:02:48,108 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:02:48,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:02:48,110 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 00:02:48,111 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:02:48,267 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:02:48,267 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:02:48,378 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:02:48,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725633216] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:02:48,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:02:48,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 20 [2023-11-29 00:02:48,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783288337] [2023-11-29 00:02:48,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:02:48,379 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 00:02:48,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:48,379 INFO L85 PathProgramCache]: Analyzing trace with hash 86024808, now seen corresponding path program 11 times [2023-11-29 00:02:48,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:48,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350431390] [2023-11-29 00:02:48,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:48,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:48,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:48,389 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:02:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:48,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:02:48,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:02:48,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-29 00:02:48,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2023-11-29 00:02:48,888 INFO L87 Difference]: Start difference. First operand 232 states and 298 transitions. cyclomatic complexity: 78 Second operand has 21 states, 20 states have (on average 2.3) internal successors, (46), 21 states have internal predecessors, (46), 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 00:02:49,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:02:49,089 INFO L93 Difference]: Finished difference Result 242 states and 311 transitions. [2023-11-29 00:02:49,089 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 242 states and 311 transitions. [2023-11-29 00:02:49,090 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 112 [2023-11-29 00:02:49,092 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 242 states to 242 states and 311 transitions. [2023-11-29 00:02:49,093 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 149 [2023-11-29 00:02:49,093 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 149 [2023-11-29 00:02:49,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 242 states and 311 transitions. [2023-11-29 00:02:49,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 00:02:49,093 INFO L218 hiAutomatonCegarLoop]: Abstraction has 242 states and 311 transitions. [2023-11-29 00:02:49,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states and 311 transitions. [2023-11-29 00:02:49,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 231. [2023-11-29 00:02:49,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 231 states have (on average 1.2857142857142858) internal successors, (297), 230 states have internal predecessors, (297), 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 00:02:49,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 297 transitions. [2023-11-29 00:02:49,100 INFO L240 hiAutomatonCegarLoop]: Abstraction has 231 states and 297 transitions. [2023-11-29 00:02:49,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 00:02:49,101 INFO L428 stractBuchiCegarLoop]: Abstraction has 231 states and 297 transitions. [2023-11-29 00:02:49,101 INFO L335 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2023-11-29 00:02:49,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 231 states and 297 transitions. [2023-11-29 00:02:49,102 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 112 [2023-11-29 00:02:49,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:02:49,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:02:49,103 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:02:49,103 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1] [2023-11-29 00:02:49,103 INFO L748 eck$LassoCheckResult]: Stem: 6423#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6424#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 6421#L558 assume !(main_~array_size~0#1 < 1); 6422#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 6429#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 6433#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 6434#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 6435#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 6442#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 6466#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 6462#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 6463#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 6446#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 6447#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 6450#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 6415#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 6416#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 6483#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 6484#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 6495#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 6494#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 6492#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 6493#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 6595#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 6594#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 6590#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 6576#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 6550#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 6551#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 6549#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 6538#L550-2 [2023-11-29 00:02:49,104 INFO L750 eck$LassoCheckResult]: Loop: 6538#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 6536#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 6522#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 6523#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 6532#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 6567#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 6564#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 6562#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 6556#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 6512#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 6515#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 6548#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 6538#L550-2 [2023-11-29 00:02:49,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:49,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1271309341, now seen corresponding path program 7 times [2023-11-29 00:02:49,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:49,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840815129] [2023-11-29 00:02:49,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:49,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:49,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:49,126 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:02:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:49,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:02:49,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:49,144 INFO L85 PathProgramCache]: Analyzing trace with hash 86024808, now seen corresponding path program 12 times [2023-11-29 00:02:49,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:49,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943376780] [2023-11-29 00:02:49,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:49,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:49,153 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:02:49,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:49,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:02:49,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:49,160 INFO L85 PathProgramCache]: Analyzing trace with hash -563741564, now seen corresponding path program 7 times [2023-11-29 00:02:49,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:49,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087197714] [2023-11-29 00:02:49,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:49,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:49,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:50,984 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 31 proven. 71 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 00:02:50,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:02:50,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087197714] [2023-11-29 00:02:50,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087197714] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:02:50,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715444765] [2023-11-29 00:02:50,985 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-29 00:02:50,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:02:50,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:50,986 INFO L229 MonitoredProcess]: Starting monitored process 76 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:02:50,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2023-11-29 00:02:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:51,094 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-29 00:02:51,096 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:02:51,167 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:02:51,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 42 treesize of output 22 [2023-11-29 00:02:51,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:02:51,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 31 [2023-11-29 00:02:51,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:02:51,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 31 [2023-11-29 00:02:51,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:02:51,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 36 treesize of output 12 [2023-11-29 00:02:51,429 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 37 proven. 35 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-11-29 00:02:51,429 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:02:51,785 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 136 treesize of output 116 [2023-11-29 00:02:51,831 INFO L349 Elim1Store]: treesize reduction 16, result has 69.8 percent of original size [2023-11-29 00:02:51,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 22152 treesize of output 14079 [2023-11-29 00:02:51,972 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 32 proven. 38 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-29 00:02:51,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715444765] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:02:51,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:02:51,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 12, 11] total 42 [2023-11-29 00:02:51,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357390060] [2023-11-29 00:02:51,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:02:52,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:02:52,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-29 00:02:52,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1565, Unknown=0, NotChecked=0, Total=1722 [2023-11-29 00:02:52,499 INFO L87 Difference]: Start difference. First operand 231 states and 297 transitions. cyclomatic complexity: 78 Second operand has 42 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 42 states have internal predecessors, (80), 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 00:02:57,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:02:57,553 INFO L93 Difference]: Finished difference Result 580 states and 735 transitions. [2023-11-29 00:02:57,553 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 580 states and 735 transitions. [2023-11-29 00:02:57,555 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 383 [2023-11-29 00:02:57,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 580 states to 568 states and 722 transitions. [2023-11-29 00:02:57,559 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 458 [2023-11-29 00:02:57,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 465 [2023-11-29 00:02:57,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 568 states and 722 transitions. [2023-11-29 00:02:57,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 00:02:57,560 INFO L218 hiAutomatonCegarLoop]: Abstraction has 568 states and 722 transitions. [2023-11-29 00:02:57,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states and 722 transitions. [2023-11-29 00:02:57,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 310. [2023-11-29 00:02:57,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 310 states have (on average 1.3129032258064517) internal successors, (407), 309 states have internal predecessors, (407), 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 00:02:57,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 407 transitions. [2023-11-29 00:02:57,568 INFO L240 hiAutomatonCegarLoop]: Abstraction has 310 states and 407 transitions. [2023-11-29 00:02:57,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-11-29 00:02:57,569 INFO L428 stractBuchiCegarLoop]: Abstraction has 310 states and 407 transitions. [2023-11-29 00:02:57,569 INFO L335 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2023-11-29 00:02:57,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 310 states and 407 transitions. [2023-11-29 00:02:57,570 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 183 [2023-11-29 00:02:57,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:02:57,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:02:57,570 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:02:57,570 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 2, 1, 1, 1, 1] [2023-11-29 00:02:57,571 INFO L748 eck$LassoCheckResult]: Stem: 7681#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7682#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 7676#L558 assume !(main_~array_size~0#1 < 1); 7677#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 7685#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 7686#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 7687#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 7688#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 7694#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 7701#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 7700#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 7698#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 7699#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 7696#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 7695#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 7697#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 7704#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 7705#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 7723#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 7722#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 7721#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 7718#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 7719#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 7714#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 7715#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 7674#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 7675#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 7866#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 7862#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 7863#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 7778#L550-2 [2023-11-29 00:02:57,571 INFO L750 eck$LassoCheckResult]: Loop: 7778#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 7890#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 7889#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 7888#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 7736#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 7832#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 7825#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 7826#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 7852#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 7850#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 7762#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 7763#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 7778#L550-2 [2023-11-29 00:02:57,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:57,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1214051039, now seen corresponding path program 8 times [2023-11-29 00:02:57,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:57,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639193151] [2023-11-29 00:02:57,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:57,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:57,590 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:02:57,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:57,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:02:57,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:57,602 INFO L85 PathProgramCache]: Analyzing trace with hash 823341480, now seen corresponding path program 2 times [2023-11-29 00:02:57,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:57,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960666476] [2023-11-29 00:02:57,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:57,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:57,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:57,608 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:02:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:57,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:02:57,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:57,613 INFO L85 PathProgramCache]: Analyzing trace with hash -2127247482, now seen corresponding path program 8 times [2023-11-29 00:02:57,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:57,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618494207] [2023-11-29 00:02:57,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:57,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:58,545 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 15 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:02:58,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:02:58,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618494207] [2023-11-29 00:02:58,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618494207] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:02:58,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994057911] [2023-11-29 00:02:58,546 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:02:58,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:02:58,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:58,547 INFO L229 MonitoredProcess]: Starting monitored process 77 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:02:58,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2023-11-29 00:02:58,656 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:02:58,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:02:58,658 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-29 00:02:58,660 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:02:58,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:02:58,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 48 treesize of output 24 [2023-11-29 00:02:58,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:02:58,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 36 treesize of output 12 [2023-11-29 00:02:58,914 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 34 proven. 43 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-29 00:02:58,915 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:02:59,123 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 104 treesize of output 88 [2023-11-29 00:02:59,145 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-11-29 00:02:59,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 672 treesize of output 431 [2023-11-29 00:02:59,184 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 16 proven. 61 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-29 00:02:59,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994057911] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:02:59,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:02:59,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11, 11] total 37 [2023-11-29 00:02:59,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732876448] [2023-11-29 00:02:59,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:02:59,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:02:59,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-11-29 00:02:59,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1204, Unknown=0, NotChecked=0, Total=1332 [2023-11-29 00:02:59,423 INFO L87 Difference]: Start difference. First operand 310 states and 407 transitions. cyclomatic complexity: 110 Second operand has 37 states, 37 states have (on average 2.324324324324324) internal successors, (86), 37 states have internal predecessors, (86), 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 00:03:01,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:03:01,249 INFO L93 Difference]: Finished difference Result 570 states and 730 transitions. [2023-11-29 00:03:01,250 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 570 states and 730 transitions. [2023-11-29 00:03:01,252 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 377 [2023-11-29 00:03:01,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 570 states to 570 states and 730 transitions. [2023-11-29 00:03:01,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 450 [2023-11-29 00:03:01,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 450 [2023-11-29 00:03:01,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 570 states and 730 transitions. [2023-11-29 00:03:01,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 00:03:01,256 INFO L218 hiAutomatonCegarLoop]: Abstraction has 570 states and 730 transitions. [2023-11-29 00:03:01,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states and 730 transitions. [2023-11-29 00:03:01,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 409. [2023-11-29 00:03:01,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 409 states have (on average 1.3251833740831296) internal successors, (542), 408 states have internal predecessors, (542), 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 00:03:01,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 542 transitions. [2023-11-29 00:03:01,265 INFO L240 hiAutomatonCegarLoop]: Abstraction has 409 states and 542 transitions. [2023-11-29 00:03:01,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-11-29 00:03:01,266 INFO L428 stractBuchiCegarLoop]: Abstraction has 409 states and 542 transitions. [2023-11-29 00:03:01,266 INFO L335 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2023-11-29 00:03:01,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 409 states and 542 transitions. [2023-11-29 00:03:01,268 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 269 [2023-11-29 00:03:01,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:03:01,268 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:03:01,269 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:01,269 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 1, 1, 1] [2023-11-29 00:03:01,269 INFO L748 eck$LassoCheckResult]: Stem: 8905#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8906#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 8903#L558 assume !(main_~array_size~0#1 < 1); 8904#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 8910#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 8913#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 8914#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 8915#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 8921#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 8928#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 8927#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 8925#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 8926#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 8923#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 8922#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 8924#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 8931#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 8932#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 8952#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 8953#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 8948#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 8949#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 9076#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 9075#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 9073#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 9074#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 9113#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 9099#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 9106#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 9147#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 9004#L550-2 [2023-11-29 00:03:01,269 INFO L750 eck$LassoCheckResult]: Loop: 9004#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 9133#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 9131#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 9123#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 9120#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 9119#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 9115#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 9116#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 9146#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 9145#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 8993#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 8994#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 9142#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 8989#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 9010#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 9004#L550-2 [2023-11-29 00:03:01,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:01,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1214049117, now seen corresponding path program 3 times [2023-11-29 00:03:01,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:01,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158775562] [2023-11-29 00:03:01,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:01,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:03:01,292 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:03:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:03:01,307 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:03:01,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:01,307 INFO L85 PathProgramCache]: Analyzing trace with hash -392095369, now seen corresponding path program 3 times [2023-11-29 00:03:01,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:01,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025582059] [2023-11-29 00:03:01,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:01,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:01,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:03:01,315 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:03:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:03:01,320 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:03:01,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:01,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1406962331, now seen corresponding path program 9 times [2023-11-29 00:03:01,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:01,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182331224] [2023-11-29 00:03:01,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:01,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:01,529 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 28 proven. 77 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-29 00:03:01,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:03:01,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182331224] [2023-11-29 00:03:01,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182331224] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:03:01,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81460589] [2023-11-29 00:03:01,529 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 00:03:01,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:03:01,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:03:01,530 INFO L229 MonitoredProcess]: Starting monitored process 78 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:03:01,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2023-11-29 00:03:01,843 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-29 00:03:01,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:03:01,846 INFO L262 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 00:03:01,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:03:02,021 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 36 proven. 66 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-29 00:03:02,021 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:03:02,146 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 36 proven. 66 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-29 00:03:02,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81460589] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:03:02,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:03:02,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 26 [2023-11-29 00:03:02,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595801231] [2023-11-29 00:03:02,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:03:02,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:03:02,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 00:03:02,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2023-11-29 00:03:02,728 INFO L87 Difference]: Start difference. First operand 409 states and 542 transitions. cyclomatic complexity: 149 Second operand has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 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 00:03:03,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:03:03,375 INFO L93 Difference]: Finished difference Result 1171 states and 1489 transitions. [2023-11-29 00:03:03,375 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1171 states and 1489 transitions. [2023-11-29 00:03:03,381 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 799 [2023-11-29 00:03:03,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1171 states to 1171 states and 1489 transitions. [2023-11-29 00:03:03,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 956 [2023-11-29 00:03:03,388 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 956 [2023-11-29 00:03:03,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1171 states and 1489 transitions. [2023-11-29 00:03:03,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 00:03:03,389 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1171 states and 1489 transitions. [2023-11-29 00:03:03,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states and 1489 transitions. [2023-11-29 00:03:03,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 545. [2023-11-29 00:03:03,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 545 states have (on average 1.3743119266055046) internal successors, (749), 544 states have internal predecessors, (749), 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 00:03:03,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 749 transitions. [2023-11-29 00:03:03,403 INFO L240 hiAutomatonCegarLoop]: Abstraction has 545 states and 749 transitions. [2023-11-29 00:03:03,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-11-29 00:03:03,403 INFO L428 stractBuchiCegarLoop]: Abstraction has 545 states and 749 transitions. [2023-11-29 00:03:03,403 INFO L335 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2023-11-29 00:03:03,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 545 states and 749 transitions. [2023-11-29 00:03:03,405 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 319 [2023-11-29 00:03:03,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:03:03,405 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:03:03,405 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:03,405 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1] [2023-11-29 00:03:03,405 INFO L748 eck$LassoCheckResult]: Stem: 10850#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10851#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 10844#L558 assume !(main_~array_size~0#1 < 1); 10845#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 10853#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 10854#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10866#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 10864#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10865#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 10867#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10855#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 10856#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10894#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 10861#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10862#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 10838#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 10839#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 10870#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 10890#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 10888#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 10889#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 10883#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 10884#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 10879#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 10880#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 11281#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 11316#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 11317#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 11322#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 11321#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 10947#L550-2 [2023-11-29 00:03:03,405 INFO L750 eck$LassoCheckResult]: Loop: 10947#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 11297#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 11288#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 11285#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 11286#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 11272#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 11267#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 11265#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 11263#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 11261#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 10933#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 10958#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 10947#L550-2 [2023-11-29 00:03:03,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:03,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1214051039, now seen corresponding path program 9 times [2023-11-29 00:03:03,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:03,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891243573] [2023-11-29 00:03:03,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:03,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:03,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:03:03,424 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:03:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:03:03,436 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:03:03,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:03,436 INFO L85 PathProgramCache]: Analyzing trace with hash 86024808, now seen corresponding path program 13 times [2023-11-29 00:03:03,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:03,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592237855] [2023-11-29 00:03:03,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:03,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:03:03,444 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:03:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:03:03,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:03:03,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:03,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1430403142, now seen corresponding path program 10 times [2023-11-29 00:03:03,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:03,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132927349] [2023-11-29 00:03:03,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:03,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:03,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:05,396 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 14 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:05,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:03:05,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132927349] [2023-11-29 00:03:05,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132927349] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:03:05,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628659766] [2023-11-29 00:03:05,396 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 00:03:05,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:03:05,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:03:05,397 INFO L229 MonitoredProcess]: Starting monitored process 79 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:03:05,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2023-11-29 00:03:05,525 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 00:03:05,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:03:05,527 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-29 00:03:05,529 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:03:05,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:03:05,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 42 treesize of output 22 [2023-11-29 00:03:05,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:03:05,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 31 [2023-11-29 00:03:05,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:03:05,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 31 [2023-11-29 00:03:05,865 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:03:05,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 31 [2023-11-29 00:03:05,959 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:03:05,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 33 [2023-11-29 00:03:06,051 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:03:06,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 36 treesize of output 12 [2023-11-29 00:03:06,087 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 19 proven. 59 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-29 00:03:06,087 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:03:06,804 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 170 treesize of output 146 [2023-11-29 00:03:06,905 INFO L349 Elim1Store]: treesize reduction 16, result has 77.5 percent of original size [2023-11-29 00:03:06,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 998408 treesize of output 645425 [2023-11-29 00:03:07,314 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 16 proven. 61 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-29 00:03:07,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628659766] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:03:07,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:03:07,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 16, 15] total 54 [2023-11-29 00:03:07,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967496895] [2023-11-29 00:03:07,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:03:07,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:03:07,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-11-29 00:03:07,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=2651, Unknown=0, NotChecked=0, Total=2862 [2023-11-29 00:03:07,791 INFO L87 Difference]: Start difference. First operand 545 states and 749 transitions. cyclomatic complexity: 228 Second operand has 54 states, 54 states have (on average 1.7222222222222223) internal successors, (93), 54 states have internal predecessors, (93), 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 00:03:20,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:03:20,228 INFO L93 Difference]: Finished difference Result 1510 states and 1967 transitions. [2023-11-29 00:03:20,228 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1510 states and 1967 transitions. [2023-11-29 00:03:20,234 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 1067 [2023-11-29 00:03:20,246 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1510 states to 1510 states and 1967 transitions. [2023-11-29 00:03:20,246 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1281 [2023-11-29 00:03:20,248 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1281 [2023-11-29 00:03:20,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1510 states and 1967 transitions. [2023-11-29 00:03:20,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 00:03:20,250 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1510 states and 1967 transitions. [2023-11-29 00:03:20,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states and 1967 transitions. [2023-11-29 00:03:20,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 820. [2023-11-29 00:03:20,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 820 states have (on average 1.3878048780487804) internal successors, (1138), 819 states have internal predecessors, (1138), 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 00:03:20,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1138 transitions. [2023-11-29 00:03:20,280 INFO L240 hiAutomatonCegarLoop]: Abstraction has 820 states and 1138 transitions. [2023-11-29 00:03:20,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2023-11-29 00:03:20,281 INFO L428 stractBuchiCegarLoop]: Abstraction has 820 states and 1138 transitions. [2023-11-29 00:03:20,281 INFO L335 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2023-11-29 00:03:20,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 820 states and 1138 transitions. [2023-11-29 00:03:20,284 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 557 [2023-11-29 00:03:20,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:03:20,284 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:03:20,285 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:20,285 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 5, 2, 2, 2, 1] [2023-11-29 00:03:20,285 INFO L748 eck$LassoCheckResult]: Stem: 13479#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 13480#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 13473#L558 assume !(main_~array_size~0#1 < 1); 13474#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 13483#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 13484#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 13498#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 13491#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 13492#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 13499#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 13485#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 13486#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 13528#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 13496#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 13497#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 13467#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 13468#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 13524#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 13525#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 13744#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 13745#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 13740#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 13741#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 13737#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 13509#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 13507#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 13508#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 14189#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 14209#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 14208#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 13724#L550-2 [2023-11-29 00:03:20,285 INFO L750 eck$LassoCheckResult]: Loop: 13724#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 14165#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 14164#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 14162#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 14163#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 14246#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 13595#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 13596#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 13571#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 13573#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 13569#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 14168#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 13591#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 14126#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 14123#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 14121#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 14122#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 14110#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 14111#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 14105#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 14103#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 14099#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 14100#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 14212#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 13724#L550-2 [2023-11-29 00:03:20,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:20,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1214051039, now seen corresponding path program 10 times [2023-11-29 00:03:20,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:20,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851661611] [2023-11-29 00:03:20,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:20,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:03:20,307 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:03:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:03:20,326 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:03:20,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:20,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1413991761, now seen corresponding path program 4 times [2023-11-29 00:03:20,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:20,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356552436] [2023-11-29 00:03:20,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:20,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:20,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:20,466 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:20,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:03:20,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356552436] [2023-11-29 00:03:20,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356552436] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:03:20,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974487912] [2023-11-29 00:03:20,467 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 00:03:20,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:03:20,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:03:20,471 INFO L229 MonitoredProcess]: Starting monitored process 80 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:03:20,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2023-11-29 00:03:20,619 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 00:03:20,619 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:03:20,620 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 00:03:20,621 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:03:20,714 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:20,714 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:03:20,783 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:20,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974487912] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:03:20,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:03:20,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 14 [2023-11-29 00:03:20,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343354315] [2023-11-29 00:03:20,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:03:20,783 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 00:03:20,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:03:20,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 00:03:20,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-11-29 00:03:20,784 INFO L87 Difference]: Start difference. First operand 820 states and 1138 transitions. cyclomatic complexity: 346 Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 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 00:03:20,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:03:20,937 INFO L93 Difference]: Finished difference Result 976 states and 1320 transitions. [2023-11-29 00:03:20,937 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 976 states and 1320 transitions. [2023-11-29 00:03:20,941 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 415 [2023-11-29 00:03:20,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 976 states to 972 states and 1316 transitions. [2023-11-29 00:03:20,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 745 [2023-11-29 00:03:20,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 745 [2023-11-29 00:03:20,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 972 states and 1316 transitions. [2023-11-29 00:03:20,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 00:03:20,950 INFO L218 hiAutomatonCegarLoop]: Abstraction has 972 states and 1316 transitions. [2023-11-29 00:03:20,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states and 1316 transitions. [2023-11-29 00:03:20,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 745. [2023-11-29 00:03:20,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 745 states have (on average 1.4053691275167786) internal successors, (1047), 744 states have internal predecessors, (1047), 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 00:03:20,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1047 transitions. [2023-11-29 00:03:20,972 INFO L240 hiAutomatonCegarLoop]: Abstraction has 745 states and 1047 transitions. [2023-11-29 00:03:20,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 00:03:20,973 INFO L428 stractBuchiCegarLoop]: Abstraction has 745 states and 1047 transitions. [2023-11-29 00:03:20,973 INFO L335 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2023-11-29 00:03:20,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 745 states and 1047 transitions. [2023-11-29 00:03:20,975 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 415 [2023-11-29 00:03:20,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:03:20,975 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:03:20,976 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:20,976 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 4, 3, 3, 3, 2] [2023-11-29 00:03:20,976 INFO L748 eck$LassoCheckResult]: Stem: 15445#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 15446#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 15443#L558 assume !(main_~array_size~0#1 < 1); 15444#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 15451#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 15454#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 15468#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 15462#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 15463#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 15469#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 15455#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 15456#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 15499#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 15498#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 15497#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 15478#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 15479#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 15544#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 15543#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 15541#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 15540#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 15539#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 15536#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 15522#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 15518#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 15514#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 15515#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 16103#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 15504#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 15505#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 16145#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 16108#L552 [2023-11-29 00:03:20,976 INFO L750 eck$LassoCheckResult]: Loop: 16108#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 16105#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 16104#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 15460#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 15461#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 16178#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 16177#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 16150#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 16176#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 15448#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 16109#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 16167#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 15740#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 16166#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 16165#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 16164#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 16163#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 16162#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 16160#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 16107#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 16154#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 15623#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 16152#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 16151#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 16149#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 16148#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 16146#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 16108#L552 [2023-11-29 00:03:20,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:20,977 INFO L85 PathProgramCache]: Analyzing trace with hash 914001837, now seen corresponding path program 4 times [2023-11-29 00:03:20,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:20,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908335749] [2023-11-29 00:03:20,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:20,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:21,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:03:21,000 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:03:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:03:21,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:03:21,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:21,020 INFO L85 PathProgramCache]: Analyzing trace with hash -696350515, now seen corresponding path program 5 times [2023-11-29 00:03:21,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:21,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881288186] [2023-11-29 00:03:21,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:21,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:21,095 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 44 proven. 22 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 00:03:21,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:03:21,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881288186] [2023-11-29 00:03:21,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881288186] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:03:21,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254075146] [2023-11-29 00:03:21,096 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 00:03:21,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:03:21,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:03:21,097 INFO L229 MonitoredProcess]: Starting monitored process 81 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:03:21,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2023-11-29 00:03:21,203 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2023-11-29 00:03:21,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:03:21,204 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 00:03:21,204 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:03:21,249 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 52 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 00:03:21,249 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:03:21,305 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 52 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 00:03:21,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254075146] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:03:21,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:03:21,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 12 [2023-11-29 00:03:21,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812258358] [2023-11-29 00:03:21,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:03:21,305 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 00:03:21,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:03:21,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 00:03:21,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-11-29 00:03:21,306 INFO L87 Difference]: Start difference. First operand 745 states and 1047 transitions. cyclomatic complexity: 329 Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 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 00:03:21,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:03:21,403 INFO L93 Difference]: Finished difference Result 745 states and 1044 transitions. [2023-11-29 00:03:21,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 745 states and 1044 transitions. [2023-11-29 00:03:21,405 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 382 [2023-11-29 00:03:21,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 745 states to 499 states and 648 transitions. [2023-11-29 00:03:21,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 390 [2023-11-29 00:03:21,408 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 390 [2023-11-29 00:03:21,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 499 states and 648 transitions. [2023-11-29 00:03:21,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:03:21,409 INFO L218 hiAutomatonCegarLoop]: Abstraction has 499 states and 648 transitions. [2023-11-29 00:03:21,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states and 648 transitions. [2023-11-29 00:03:21,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 478. [2023-11-29 00:03:21,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 478 states have (on average 1.299163179916318) internal successors, (621), 477 states have internal predecessors, (621), 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 00:03:21,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 621 transitions. [2023-11-29 00:03:21,417 INFO L240 hiAutomatonCegarLoop]: Abstraction has 478 states and 621 transitions. [2023-11-29 00:03:21,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 00:03:21,417 INFO L428 stractBuchiCegarLoop]: Abstraction has 478 states and 621 transitions. [2023-11-29 00:03:21,417 INFO L335 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2023-11-29 00:03:21,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 478 states and 621 transitions. [2023-11-29 00:03:21,418 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 361 [2023-11-29 00:03:21,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:03:21,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:03:21,419 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:21,419 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 5, 4, 1, 1, 1, 1] [2023-11-29 00:03:21,420 INFO L748 eck$LassoCheckResult]: Stem: 17119#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 17120#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 17115#L558 assume !(main_~array_size~0#1 < 1); 17116#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 17123#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 17124#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 17125#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 17126#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 17132#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 17140#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 17139#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 17138#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 17137#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 17136#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 17135#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 17134#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 17133#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 17109#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 17110#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 17154#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 17155#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 17165#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 17161#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 17162#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 17226#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 17225#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 17223#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 17222#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 17221#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 17219#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 17220#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 17329#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 17323#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 17214#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 17322#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 17316#L550-2 [2023-11-29 00:03:21,420 INFO L750 eck$LassoCheckResult]: Loop: 17316#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 17313#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 17310#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 17306#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 17128#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 17547#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 17535#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 17187#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 17370#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 17369#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 17255#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 17307#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 17303#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 17231#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 17358#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 17321#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 17215#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 17320#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 17316#L550-2 [2023-11-29 00:03:21,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:21,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1466927742, now seen corresponding path program 11 times [2023-11-29 00:03:21,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:21,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118749815] [2023-11-29 00:03:21,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:21,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:21,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:03:21,441 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:03:21,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:03:21,458 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:03:21,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:21,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1139843210, now seen corresponding path program 6 times [2023-11-29 00:03:21,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:21,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811769882] [2023-11-29 00:03:21,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:21,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:03:21,470 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:03:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:03:21,478 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:03:21,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:21,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1778980811, now seen corresponding path program 11 times [2023-11-29 00:03:21,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:21,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558897314] [2023-11-29 00:03:21,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:21,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:21,757 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 41 proven. 117 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-29 00:03:21,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:03:21,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558897314] [2023-11-29 00:03:21,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558897314] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:03:21,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652253581] [2023-11-29 00:03:21,758 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 00:03:21,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:03:21,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:03:21,761 INFO L229 MonitoredProcess]: Starting monitored process 82 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:03:21,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2023-11-29 00:03:22,481 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2023-11-29 00:03:22,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:03:22,485 INFO L262 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 00:03:22,487 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:03:22,706 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 52 proven. 105 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-29 00:03:22,706 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:03:22,867 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 52 proven. 105 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-29 00:03:22,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652253581] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:03:22,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:03:22,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 30 [2023-11-29 00:03:22,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277934763] [2023-11-29 00:03:22,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:03:24,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:03:24,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-29 00:03:24,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=720, Unknown=0, NotChecked=0, Total=870 [2023-11-29 00:03:24,498 INFO L87 Difference]: Start difference. First operand 478 states and 621 transitions. cyclomatic complexity: 156 Second operand has 30 states, 30 states have (on average 2.7666666666666666) internal successors, (83), 30 states have internal predecessors, (83), 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 00:03:24,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:03:24,931 INFO L93 Difference]: Finished difference Result 1237 states and 1565 transitions. [2023-11-29 00:03:24,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1237 states and 1565 transitions. [2023-11-29 00:03:24,936 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 459 [2023-11-29 00:03:24,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1237 states to 627 states and 822 transitions. [2023-11-29 00:03:24,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 467 [2023-11-29 00:03:24,940 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 467 [2023-11-29 00:03:24,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 627 states and 822 transitions. [2023-11-29 00:03:24,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:03:24,941 INFO L218 hiAutomatonCegarLoop]: Abstraction has 627 states and 822 transitions. [2023-11-29 00:03:24,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states and 822 transitions. [2023-11-29 00:03:24,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 564. [2023-11-29 00:03:24,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 564 states have (on average 1.2943262411347518) internal successors, (730), 563 states have internal predecessors, (730), 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 00:03:24,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 730 transitions. [2023-11-29 00:03:24,950 INFO L240 hiAutomatonCegarLoop]: Abstraction has 564 states and 730 transitions. [2023-11-29 00:03:24,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-29 00:03:24,950 INFO L428 stractBuchiCegarLoop]: Abstraction has 564 states and 730 transitions. [2023-11-29 00:03:24,950 INFO L335 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2023-11-29 00:03:24,951 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 564 states and 730 transitions. [2023-11-29 00:03:24,952 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 419 [2023-11-29 00:03:24,952 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:03:24,952 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:03:24,952 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 6, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:24,952 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 4, 2, 1, 1, 1] [2023-11-29 00:03:24,953 INFO L748 eck$LassoCheckResult]: Stem: 19225#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 19226#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 19219#L558 assume !(main_~array_size~0#1 < 1); 19220#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 19227#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 19229#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 19230#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 19231#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 19238#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 19248#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 19247#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 19246#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 19245#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 19244#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 19243#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 19242#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 19241#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 19240#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 19239#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 19213#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 19214#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 19282#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 19283#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 19286#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 19280#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 19281#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 19382#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 19381#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 19379#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 19378#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 19377#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 19375#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 19376#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 19458#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 19457#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 19452#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 19448#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 19434#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 19351#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 19433#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 19431#L550-2 [2023-11-29 00:03:24,953 INFO L750 eck$LassoCheckResult]: Loop: 19431#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 19429#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 19427#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 19423#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 19424#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 19585#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 19690#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 19315#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 19506#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 19505#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 19504#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 19503#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 19502#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 19359#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 19498#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 19497#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 19355#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 19485#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 19436#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 19346#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 19435#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 19431#L550-2 [2023-11-29 00:03:24,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:24,953 INFO L85 PathProgramCache]: Analyzing trace with hash 440793921, now seen corresponding path program 12 times [2023-11-29 00:03:24,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:24,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321892908] [2023-11-29 00:03:24,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:24,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:03:24,980 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:03:24,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:03:25,004 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:03:25,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:25,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1315893779, now seen corresponding path program 7 times [2023-11-29 00:03:25,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:25,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814579014] [2023-11-29 00:03:25,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:25,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:03:25,016 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:03:25,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:03:25,025 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:03:25,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:25,025 INFO L85 PathProgramCache]: Analyzing trace with hash -2135785773, now seen corresponding path program 12 times [2023-11-29 00:03:25,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:25,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492570549] [2023-11-29 00:03:25,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:25,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:25,324 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 57 proven. 165 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-11-29 00:03:25,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:03:25,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492570549] [2023-11-29 00:03:25,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492570549] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:03:25,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9927355] [2023-11-29 00:03:25,324 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-29 00:03:25,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:03:25,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:03:25,326 INFO L229 MonitoredProcess]: Starting monitored process 83 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:03:25,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2023-11-29 00:03:26,295 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2023-11-29 00:03:26,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:03:26,300 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-29 00:03:26,301 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:03:26,574 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 173 proven. 49 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-11-29 00:03:26,574 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:03:26,746 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 71 proven. 151 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-11-29 00:03:26,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9927355] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:03:26,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:03:26,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 30 [2023-11-29 00:03:26,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150454243] [2023-11-29 00:03:26,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:03:28,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:03:28,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-29 00:03:28,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=692, Unknown=0, NotChecked=0, Total=870 [2023-11-29 00:03:28,921 INFO L87 Difference]: Start difference. First operand 564 states and 730 transitions. cyclomatic complexity: 179 Second operand has 30 states, 30 states have (on average 2.9) internal successors, (87), 30 states have internal predecessors, (87), 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 00:03:29,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:03:29,162 INFO L93 Difference]: Finished difference Result 973 states and 1230 transitions. [2023-11-29 00:03:29,162 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 973 states and 1230 transitions. [2023-11-29 00:03:29,166 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 419 [2023-11-29 00:03:29,169 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 973 states to 567 states and 733 transitions. [2023-11-29 00:03:29,169 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 427 [2023-11-29 00:03:29,170 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 427 [2023-11-29 00:03:29,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 567 states and 733 transitions. [2023-11-29 00:03:29,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:03:29,171 INFO L218 hiAutomatonCegarLoop]: Abstraction has 567 states and 733 transitions. [2023-11-29 00:03:29,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states and 733 transitions. [2023-11-29 00:03:29,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 566. [2023-11-29 00:03:29,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 566 states have (on average 1.2932862190812722) internal successors, (732), 565 states have internal predecessors, (732), 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 00:03:29,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 732 transitions. [2023-11-29 00:03:29,182 INFO L240 hiAutomatonCegarLoop]: Abstraction has 566 states and 732 transitions. [2023-11-29 00:03:29,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 00:03:29,183 INFO L428 stractBuchiCegarLoop]: Abstraction has 566 states and 732 transitions. [2023-11-29 00:03:29,183 INFO L335 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2023-11-29 00:03:29,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 566 states and 732 transitions. [2023-11-29 00:03:29,185 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 419 [2023-11-29 00:03:29,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:03:29,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:03:29,186 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:29,186 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 3, 3, 1, 1, 1] [2023-11-29 00:03:29,186 INFO L748 eck$LassoCheckResult]: Stem: 21175#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 21176#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 21171#L558 assume !(main_~array_size~0#1 < 1); 21172#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 21179#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 21180#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 21181#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 21182#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 21188#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 21200#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 21199#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 21198#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 21197#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 21196#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 21195#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 21194#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 21193#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 21192#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 21191#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 21190#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 21189#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 21165#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 21166#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 21221#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 21222#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 21231#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 21227#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 21228#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 21380#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 21375#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 21369#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 21362#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 21359#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 21353#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 21354#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 21371#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 21365#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 21360#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 21355#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 21346#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 21314#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 21345#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 21342#L550-2 [2023-11-29 00:03:29,186 INFO L750 eck$LassoCheckResult]: Loop: 21342#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 21340#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 21338#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 21335#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 21330#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 21328#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 21325#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 21323#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 21321#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 21315#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 21316#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 21666#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 21665#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 21664#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 21663#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 21662#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 21660#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 21659#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 21653#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 21283#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 21347#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 21342#L550-2 [2023-11-29 00:03:29,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:29,186 INFO L85 PathProgramCache]: Analyzing trace with hash -20426973, now seen corresponding path program 13 times [2023-11-29 00:03:29,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:29,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046144128] [2023-11-29 00:03:29,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:29,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:29,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:29,476 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 36 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:29,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:03:29,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046144128] [2023-11-29 00:03:29,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046144128] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:03:29,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086134499] [2023-11-29 00:03:29,477 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-29 00:03:29,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:03:29,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:03:29,478 INFO L229 MonitoredProcess]: Starting monitored process 84 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:03:29,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2023-11-29 00:03:29,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:29,616 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-29 00:03:29,617 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:03:29,850 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 49 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:29,851 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:03:30,039 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 49 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:30,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086134499] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:03:30,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:03:30,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 29 [2023-11-29 00:03:30,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803369823] [2023-11-29 00:03:30,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:03:30,041 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 00:03:30,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:30,041 INFO L85 PathProgramCache]: Analyzing trace with hash -247612139, now seen corresponding path program 8 times [2023-11-29 00:03:30,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:30,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505701487] [2023-11-29 00:03:30,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:30,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:30,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:03:30,052 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:03:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:03:30,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:03:31,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:03:31,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-29 00:03:31,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=689, Unknown=0, NotChecked=0, Total=870 [2023-11-29 00:03:31,404 INFO L87 Difference]: Start difference. First operand 566 states and 732 transitions. cyclomatic complexity: 179 Second operand has 30 states, 29 states have (on average 2.413793103448276) internal successors, (70), 30 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:31,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:03:31,678 INFO L93 Difference]: Finished difference Result 628 states and 813 transitions. [2023-11-29 00:03:31,678 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 628 states and 813 transitions. [2023-11-29 00:03:31,680 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 419 [2023-11-29 00:03:31,683 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 628 states to 628 states and 813 transitions. [2023-11-29 00:03:31,683 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 437 [2023-11-29 00:03:31,684 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 437 [2023-11-29 00:03:31,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 628 states and 813 transitions. [2023-11-29 00:03:31,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:03:31,685 INFO L218 hiAutomatonCegarLoop]: Abstraction has 628 states and 813 transitions. [2023-11-29 00:03:31,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states and 813 transitions. [2023-11-29 00:03:31,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 595. [2023-11-29 00:03:31,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 595 states have (on average 1.2941176470588236) internal successors, (770), 594 states have internal predecessors, (770), 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 00:03:31,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 770 transitions. [2023-11-29 00:03:31,697 INFO L240 hiAutomatonCegarLoop]: Abstraction has 595 states and 770 transitions. [2023-11-29 00:03:31,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 00:03:31,698 INFO L428 stractBuchiCegarLoop]: Abstraction has 595 states and 770 transitions. [2023-11-29 00:03:31,698 INFO L335 stractBuchiCegarLoop]: ======== Iteration 29 ============ [2023-11-29 00:03:31,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 595 states and 770 transitions. [2023-11-29 00:03:31,700 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 419 [2023-11-29 00:03:31,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:03:31,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:03:31,702 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:31,702 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 6, 1, 1, 1] [2023-11-29 00:03:31,702 INFO L748 eck$LassoCheckResult]: Stem: 22671#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 22672#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 22666#L558 assume !(main_~array_size~0#1 < 1); 22667#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 22675#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 22676#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 22677#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 22678#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 22684#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 22696#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 22695#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 22694#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 22693#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 22692#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 22691#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 22690#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 22689#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 22688#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 22687#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 22686#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 22685#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 22660#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 22661#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 22718#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 22719#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 22729#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 22725#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 22726#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 22918#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 22917#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 22915#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 22916#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 22937#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 22938#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 22900#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 22899#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 22898#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 22895#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 22894#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 22893#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 22886#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 22881#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 22859#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 22810#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 22858#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 22843#L550-2 [2023-11-29 00:03:31,702 INFO L750 eck$LassoCheckResult]: Loop: 22843#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 22841#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 22839#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 22836#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 22833#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 22831#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 22828#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 22826#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 22825#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 22822#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 22820#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 22818#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 22816#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 22787#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 22868#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 22867#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 22783#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 22864#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 22861#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 22775#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 22860#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 22843#L550-2 [2023-11-29 00:03:31,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:31,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1345506718, now seen corresponding path program 14 times [2023-11-29 00:03:31,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:31,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812838701] [2023-11-29 00:03:31,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:31,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:31,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:03:31,739 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:03:31,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:03:31,773 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:03:31,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:31,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1243094249, now seen corresponding path program 14 times [2023-11-29 00:03:31,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:31,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502714555] [2023-11-29 00:03:31,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:31,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:03:31,788 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:03:31,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:03:31,799 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:03:31,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:31,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1869261210, now seen corresponding path program 13 times [2023-11-29 00:03:31,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:31,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103636302] [2023-11-29 00:03:31,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:31,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:31,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:35,619 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 104 proven. 215 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 00:03:35,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:03:35,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103636302] [2023-11-29 00:03:35,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103636302] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:03:35,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903548016] [2023-11-29 00:03:35,620 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-29 00:03:35,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:03:35,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:03:35,621 INFO L229 MonitoredProcess]: Starting monitored process 85 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:03:35,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2023-11-29 00:03:35,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:35,790 INFO L262 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-29 00:03:35,794 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:03:35,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:03:35,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 42 treesize of output 22 [2023-11-29 00:03:35,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:03:35,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 31 [2023-11-29 00:03:36,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:03:36,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 31 [2023-11-29 00:03:36,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:03:36,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 31 [2023-11-29 00:03:36,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:03:36,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 31 [2023-11-29 00:03:36,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:03:36,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 33 [2023-11-29 00:03:36,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:03:36,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 33 [2023-11-29 00:03:36,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:03:36,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 36 treesize of output 12 [2023-11-29 00:03:36,656 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 97 proven. 146 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2023-11-29 00:03:36,656 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:03:37,904 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 204 treesize of output 176 [2023-11-29 00:03:38,154 INFO L349 Elim1Store]: treesize reduction 16, result has 82.0 percent of original size [2023-11-29 00:03:38,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 384972808 treesize of output 240891971 [2023-11-29 00:03:39,472 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 90 proven. 150 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2023-11-29 00:03:39,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903548016] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:03:39,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:03:39,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 20, 19] total 71 [2023-11-29 00:03:39,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52020645] [2023-11-29 00:03:39,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:03:42,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:03:42,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2023-11-29 00:03:42,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=4657, Unknown=0, NotChecked=0, Total=4970 [2023-11-29 00:03:42,063 INFO L87 Difference]: Start difference. First operand 595 states and 770 transitions. cyclomatic complexity: 188 Second operand has 71 states, 71 states have (on average 1.7605633802816902) internal successors, (125), 71 states have internal predecessors, (125), 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 00:03:53,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:03:53,609 INFO L93 Difference]: Finished difference Result 1345 states and 1723 transitions. [2023-11-29 00:03:53,609 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1345 states and 1723 transitions. [2023-11-29 00:03:53,613 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1029 [2023-11-29 00:03:53,621 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1345 states to 1345 states and 1723 transitions. [2023-11-29 00:03:53,621 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1132 [2023-11-29 00:03:53,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1132 [2023-11-29 00:03:53,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1345 states and 1723 transitions. [2023-11-29 00:03:53,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:03:53,625 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1345 states and 1723 transitions. [2023-11-29 00:03:53,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states and 1723 transitions. [2023-11-29 00:03:53,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 980. [2023-11-29 00:03:53,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 980 states have (on average 1.296938775510204) internal successors, (1271), 979 states have internal predecessors, (1271), 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 00:03:53,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1271 transitions. [2023-11-29 00:03:53,649 INFO L240 hiAutomatonCegarLoop]: Abstraction has 980 states and 1271 transitions. [2023-11-29 00:03:53,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2023-11-29 00:03:53,650 INFO L428 stractBuchiCegarLoop]: Abstraction has 980 states and 1271 transitions. [2023-11-29 00:03:53,650 INFO L335 stractBuchiCegarLoop]: ======== Iteration 30 ============ [2023-11-29 00:03:53,650 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 980 states and 1271 transitions. [2023-11-29 00:03:53,653 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 782 [2023-11-29 00:03:53,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:03:53,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:03:53,655 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 7, 7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:53,655 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 4, 2, 1, 1, 1] [2023-11-29 00:03:53,655 INFO L748 eck$LassoCheckResult]: Stem: 25268#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 25269#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 25263#L558 assume !(main_~array_size~0#1 < 1); 25264#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 25272#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 25273#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 25274#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 25275#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 25281#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 25293#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 25292#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 25291#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 25290#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 25289#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 25288#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 25287#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 25286#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 25285#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 25284#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 25283#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 25282#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 25257#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 25258#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 25294#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 25295#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 25328#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 25324#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 25325#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 25401#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 25400#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 25398#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 25397#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 25396#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 25394#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 25393#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 25392#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 25390#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 25391#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 25505#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 25500#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 25480#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 25493#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 25366#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 25376#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 25460#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 25459#L550-2 [2023-11-29 00:03:53,655 INFO L750 eck$LassoCheckResult]: Loop: 25459#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 25458#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 25456#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 25457#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 25570#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 25571#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 25562#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 25544#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 25543#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 25542#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 25537#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 25538#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 25534#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 25437#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 25515#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 25508#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 25414#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 25492#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 25462#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 25406#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 25461#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 25459#L550-2 [2023-11-29 00:03:53,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:53,655 INFO L85 PathProgramCache]: Analyzing trace with hash 665448348, now seen corresponding path program 15 times [2023-11-29 00:03:53,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:53,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628957319] [2023-11-29 00:03:53,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:53,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:53,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:03:53,697 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:03:53,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:03:53,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:03:53,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:53,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1315893779, now seen corresponding path program 9 times [2023-11-29 00:03:53,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:53,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21613981] [2023-11-29 00:03:53,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:53,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:53,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:03:53,745 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:03:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:03:53,755 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:03:53,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:53,756 INFO L85 PathProgramCache]: Analyzing trace with hash 110649688, now seen corresponding path program 14 times [2023-11-29 00:03:53,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:53,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118048369] [2023-11-29 00:03:53,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:53,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:56,656 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 64 proven. 260 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 00:03:56,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:03:56,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118048369] [2023-11-29 00:03:56,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118048369] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:03:56,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844497196] [2023-11-29 00:03:56,656 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:03:56,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:03:56,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:03:56,658 INFO L229 MonitoredProcess]: Starting monitored process 86 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:03:56,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2023-11-29 00:03:56,853 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:03:56,853 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:03:56,855 INFO L262 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-29 00:03:56,858 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:03:57,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:03:57,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 36 treesize of output 20 [2023-11-29 00:03:57,191 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:03:57,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 27 [2023-11-29 00:03:57,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:03:57,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 34 [2023-11-29 00:03:57,459 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:03:57,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 27 [2023-11-29 00:03:57,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:03:57,555 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 00:03:57,590 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 97 proven. 158 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2023-11-29 00:03:57,590 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:03:58,177 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 138 treesize of output 118 [2023-11-29 00:03:58,223 INFO L349 Elim1Store]: treesize reduction 16, result has 67.3 percent of original size [2023-11-29 00:03:58,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 5252 treesize of output 3183 [2023-11-29 00:03:58,534 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 62 proven. 191 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2023-11-29 00:03:58,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844497196] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:03:58,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:03:58,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 20, 17] total 64 [2023-11-29 00:03:58,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251448403] [2023-11-29 00:03:58,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:04:00,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:04:00,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2023-11-29 00:04:00,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=3740, Unknown=0, NotChecked=0, Total=4032 [2023-11-29 00:04:00,709 INFO L87 Difference]: Start difference. First operand 980 states and 1271 transitions. cyclomatic complexity: 306 Second operand has 64 states, 64 states have (on average 2.234375) internal successors, (143), 64 states have internal predecessors, (143), 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 00:04:06,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:04:06,211 INFO L93 Difference]: Finished difference Result 1456 states and 1879 transitions. [2023-11-29 00:04:06,211 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1456 states and 1879 transitions. [2023-11-29 00:04:06,215 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1146 [2023-11-29 00:04:06,222 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1456 states to 1456 states and 1879 transitions. [2023-11-29 00:04:06,222 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1182 [2023-11-29 00:04:06,223 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1182 [2023-11-29 00:04:06,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1456 states and 1879 transitions. [2023-11-29 00:04:06,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:04:06,224 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1456 states and 1879 transitions. [2023-11-29 00:04:06,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states and 1879 transitions. [2023-11-29 00:04:06,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1347. [2023-11-29 00:04:06,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1347 states, 1347 states have (on average 1.311804008908686) internal successors, (1767), 1346 states have internal predecessors, (1767), 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 00:04:06,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1767 transitions. [2023-11-29 00:04:06,243 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1347 states and 1767 transitions. [2023-11-29 00:04:06,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2023-11-29 00:04:06,244 INFO L428 stractBuchiCegarLoop]: Abstraction has 1347 states and 1767 transitions. [2023-11-29 00:04:06,244 INFO L335 stractBuchiCegarLoop]: ======== Iteration 31 ============ [2023-11-29 00:04:06,244 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1347 states and 1767 transitions. [2023-11-29 00:04:06,248 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1092 [2023-11-29 00:04:06,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:04:06,248 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:04:06,249 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:04:06,249 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 4, 2, 1, 1, 1] [2023-11-29 00:04:06,249 INFO L748 eck$LassoCheckResult]: Stem: 28287#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 28288#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 28285#L558 assume !(main_~array_size~0#1 < 1); 28286#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 28292#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 28295#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 28296#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 28297#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 28304#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 28316#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 28315#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 28314#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 28313#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 28312#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 28311#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 28310#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 28309#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 28308#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 28307#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet11#1;call write~int#0(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 28306#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 28305#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 28279#L562-4 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 28280#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 28317#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 28318#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 28350#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 28349#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 28346#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 28347#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 28672#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 28673#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 28854#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 28855#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 28849#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 28850#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 29172#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 29170#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 28573#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 28572#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 28570#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 28571#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 29147#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 28561#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 28564#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 29132#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 29128#L550-2 [2023-11-29 00:04:06,249 INFO L750 eck$LassoCheckResult]: Loop: 29128#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 29127#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 29126#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 29123#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 29121#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 29119#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 29116#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 29115#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 29114#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 29112#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 28429#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 28916#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 28917#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 28868#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 28869#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 28863#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 28865#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 28859#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 28860#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 28397#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 29130#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 29128#L550-2 [2023-11-29 00:04:06,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:04:06,250 INFO L85 PathProgramCache]: Analyzing trace with hash 608190046, now seen corresponding path program 16 times [2023-11-29 00:04:06,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:04:06,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359931480] [2023-11-29 00:04:06,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:04:06,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:04:06,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:04:06,282 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:04:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:04:06,307 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:04:06,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:04:06,308 INFO L85 PathProgramCache]: Analyzing trace with hash -505777577, now seen corresponding path program 10 times [2023-11-29 00:04:06,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:04:06,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8405542] [2023-11-29 00:04:06,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:04:06,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:04:06,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:04:06,319 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:04:06,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:04:06,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:04:06,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:04:06,328 INFO L85 PathProgramCache]: Analyzing trace with hash 660717594, now seen corresponding path program 15 times [2023-11-29 00:04:06,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:04:06,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580952655] [2023-11-29 00:04:06,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:04:06,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:04:06,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:09,082 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 26 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:04:09,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:04:09,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580952655] [2023-11-29 00:04:09,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580952655] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:04:09,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32900579] [2023-11-29 00:04:09,082 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 00:04:09,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:04:09,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:04:09,084 INFO L229 MonitoredProcess]: Starting monitored process 87 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:04:09,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd4a3fc3-ece8-4010-9dcf-aadb29956097/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2023-11-29 00:04:09,529 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2023-11-29 00:04:09,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:04:09,534 INFO L262 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-29 00:04:09,537 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:04:09,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:04:09,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 63 treesize of output 29 [2023-11-29 00:04:10,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:04:10,143 INFO L349 Elim1Store]: treesize reduction 74, result has 52.9 percent of original size [2023-11-29 00:04:10,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 69 treesize of output 111 [2023-11-29 00:04:10,684 INFO L349 Elim1Store]: treesize reduction 153, result has 49.2 percent of original size [2023-11-29 00:04:10,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 159 treesize of output 220 [2023-11-29 00:04:12,993 INFO L349 Elim1Store]: treesize reduction 256, result has 49.2 percent of original size [2023-11-29 00:04:12,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 26 case distinctions, treesize of input 334 treesize of output 378 [2023-11-29 00:04:19,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:04:19,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:04:19,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 184 treesize of output 152 [2023-11-29 00:04:19,476 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 124 proven. 103 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2023-11-29 00:04:19,477 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:04:21,671 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 301 treesize of output 261 [2023-11-29 00:04:21,673 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 00:04:21,684 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 00:04:21,702 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:04:21,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 1145 treesize of output 739 [2023-11-29 00:04:21,926 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 16 proven. 216 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2023-11-29 00:04:21,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32900579] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:04:21,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:04:21,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 23, 23] total 76 [2023-11-29 00:04:21,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282926446] [2023-11-29 00:04:21,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:04:23,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:04:23,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2023-11-29 00:04:23,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=568, Invalid=5132, Unknown=0, NotChecked=0, Total=5700 [2023-11-29 00:04:23,644 INFO L87 Difference]: Start difference. First operand 1347 states and 1767 transitions. cyclomatic complexity: 442 Second operand has 76 states, 76 states have (on average 1.855263157894737) internal successors, (141), 76 states have internal predecessors, (141), 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 00:04:25,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:04:27,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:04:31,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 00:04:47,022 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] [2023-11-29 00:05:02,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 00:05:14,778 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 00:05:16,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 00:05:31,739 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] [2023-11-29 00:05:56,156 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] [2023-11-29 00:06:00,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.92s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:06:25,546 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] [2023-11-29 00:06:41,426 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] [2023-11-29 00:06:50,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 8.72s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:07:15,603 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] [2023-11-29 00:07:33,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:07:36,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:08:53,099 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] [2023-11-29 00:09:01,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 00:09:07,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 00:09:32,048 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 [0, 1] [2023-11-29 00:09:55,050 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 00:10:26,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:10:40,098 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 00:11:06,442 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 00:11:11,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 00:11:18,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 00:11:38,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 7.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 00:12:30,444 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 00:12:42,953 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] [2023-11-29 00:12:47,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.81s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:13:30,064 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] [2023-11-29 00:13:43,814 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] [2023-11-29 00:14:23,095 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] [2023-11-29 00:15:11,964 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] [2023-11-29 00:15:24,453 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] [2023-11-29 00:15:37,045 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] [2023-11-29 00:15:49,514 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]